Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T05:45:43.947Z Has data issue: false hasContentIssue false

A Linear Programming Approximation for the General Portfolio Analysis Problem

Published online by Cambridge University Press:  19 October 2009

Extract

Almost twenty years ago, Markowitz [4] first suggested that portfolio selection be regarded as a parametric quadratic programming problem. Risk is stated in terms of the predicted variance of portfolio return — a function that is quadratic in the decision variables (the proportions of the portfolio invested in various securities). All other functions (e.g., expected return) and constraints are assumed to be linear. The objective is to find the set of efficient feasible portfolios. A portfolio is feasible if it satisfies a set of relevant linear constraints; it is efficient if it provides (1) less variance than any other feasible portfolio with the same expected return and (2) more expected return than any other feasible portfolio with the same variance.

Information

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

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