Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T08:49:34.537Z Has data issue: false hasContentIssue false

Portfolio Management and the Shrinking Knapsack Algorithm

Published online by Cambridge University Press:  06 April 2009

Extract

Since the formulation of the portfolio selection problem by Markowitz [12] as a parametric quadratic programming problem, considerable effort has been devoted to obtaining operational portfolio management models. Research has involved: (1) characterizing the return generating process in terms of index models; (2) specifying special-purpose algorithms such as the critical-line method of Markowitz [13] or the solution procedure of Jucker and de Faro [11]; (3) using linear programming formulations to approximate solutions to the nonlinear programming problems such as Sharpe [20, 22] and Stone [25]; and (4) converting portfolio selection models into portfolio management models designed to revise an existing protfolio subject to transaction costs using heuristics such as Smith [24] or revision formulations such as Pogue [16, 17] and Stone and Reback [27].

Information

Type
Research Article
Copyright
Copyright © School of Business Administration, University of Washington 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable