On linear programming solvable models for portfolio selection

On linear programming solvable models for portfolio selection

0.00 Avg rating0 Votes
Article ID: iaor20033080
Country: Lithuania
Volume: 14
Issue: 1
Start Page Number: 37
End Page Number: 62
Publication Date: Jan 2003
Journal: Informatica
Authors: , ,
Keywords: programming: linear
Abstract:

The Markowitz model for single period portfolio optimization quantifies the problem by means of only two criteria: the mean, representing the expected outcome, and the risk, a scalar measure of the variability of outcomes. The classical Markowitz model uses the variance as the risk measure, thus resulting in a quadratic optimization problem. Following Sharpe's work on linear approximation to the mean-variance model, many attempts have been made to linearize the portfolio optimization problem. There were introduced several alternative risk measures which are computationally attractive as (for discrete random variables) they result in solving Linear Programming (LP) problems. The LP solvability is very important for applications to real-life financial decisions where the constructed portfolios have to meet numerous side constraints and take into account transaction costs. This paper provides a systematic overview of the LP solvable models with a wide discussion of their properties.

Reviews

Required fields are marked *. Your email address will not be published.