1978
DOI: 10.2307/2330390
|View full text |Cite
|
Sign up to set email alerts
|

Some Problems in Applying the Continuous Portfolio Selection Model to the Discrete Capital Budgeting Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1981
1981
2008
2008

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…Quadratic programming solutions are typically continuous, while futures contracts are indivisible, discrete investments. The use of rounded-off continuous solutions as approximations of true discrete solutions may be suboptimal, and the implications of this potential problem have been noted by Heifner 1966;Baum, Carlson and Jucker 1978;Robison and Barry 1980;Rausser 1980;and Anderson and Danthine 1981. To overcome this problem, some type of discrete nonlinear programming routine must be used, and one such method is the discrete modified complex (DMC) algorithm developed by Fox and Liebman. The DMC algorithm can handle continuous variables in two ways, either by treating them as continuous variables directly or by a continuous approximation which treats them as discrete but with a small interval, or pseudoincrement.…”
Section: Previous Studiesmentioning
confidence: 99%
“…Quadratic programming solutions are typically continuous, while futures contracts are indivisible, discrete investments. The use of rounded-off continuous solutions as approximations of true discrete solutions may be suboptimal, and the implications of this potential problem have been noted by Heifner 1966;Baum, Carlson and Jucker 1978;Robison and Barry 1980;Rausser 1980;and Anderson and Danthine 1981. To overcome this problem, some type of discrete nonlinear programming routine must be used, and one such method is the discrete modified complex (DMC) algorithm developed by Fox and Liebman. The DMC algorithm can handle continuous variables in two ways, either by treating them as continuous variables directly or by a continuous approximation which treats them as discrete but with a small interval, or pseudoincrement.…”
Section: Previous Studiesmentioning
confidence: 99%
“…University of Southern California. Both Weingartner [7] and Mao [3] suggest that the solution of (M) will Jucker [1] showed that any efficient point which is not located at a corner point of the upper boundary of the convex hull of the complete set of efficient points may be missed. They showed that such points will be missed unless the utility function describing the decision maker's preferences is a linear function of the mean and variance of return.…”
Section: The Traditional Markowitz Approachmentioning
confidence: 99%
“…Baum, Carlson, and Jucker [1] show that Mao [3], Table 1. They both have the same variance, but solution 4 has the larger return.…”
Section: The Modified Approachmentioning
confidence: 99%
See 2 more Smart Citations