A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- 1 July 1998
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 108 (1), 196-207
- https://doi.org/10.1016/s0377-2217(97)00048-9
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A Branch and Bound Algorithm for Integer Quadratic Knapsack ProblemsINFORMS Journal on Computing, 1995
- A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problemOperations Research Letters, 1988
- A polynomially bounded algorithm for a singly constrained quadratic programMathematical Programming, 1980
- Simple Criteria for Optimal Portfolio Selection with Upper BoundsOperations Research, 1977
- Simple Criteria for Optimal Portfolio SelectionThe Journal of Finance, 1976
- Monotone solutions of the parametric linear complementarity problemMathematical Programming, 1972
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970
- Quadratic Binary Programming with Application to Capital-Budgeting ProblemsOperations Research, 1970
- A convex programming procedureNaval Research Logistics Quarterly, 1959
- Portfolio SelectionThe Journal of Finance, 1952