Skip to main content
Log in

Optimal portfolios using linear programming models

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The classical quadratic programming (QP) formulation of the well-known portfolio selection problem has traditionally been regarded as cumbersome and time consuming. This paper formulates two additional models: (i) maximin, and (ii) minimization of mean absolute deviation. Data from 67 securities over 48 months are used to examine to what extent all three formulations provide similar portfolios. As expected, the maximin formulation yields the highest return and risk, while the QP formulation provides the lowest risk and return, which also creates the efficient frontier. The minimization of mean absolute deviation is close to the QP formulation. When the expected returns are confronted with the true ones at the end of a 6-month period, the maximin portfolios seem to be the most robust of all.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1

Similar content being viewed by others

References

  • Markowitz H (1952). Portfolio selection. J Fin 7: 77–91.

    Google Scholar 

  • Young MR (1998). A minimax-portfolio selection rule with linear programming solution. Mngt Sci 44: 673–683.

    Article  Google Scholar 

  • León T, Liern V and Vercher E (2002). Viability of infeasible portfolio selection problems: a fuzzy approach. Eur J Opl Res 139: 178–189.

    Article  Google Scholar 

  • Konno H and Yamazaki H (1991). Mean-absolute deviation portfolio optimization model and its application to Tokyo stock market. Mngt Sci 37: 519–531.

    Article  Google Scholar 

  • Speranza MG (1996). A heuristic algorithm for a portfolio optimisation model applied to the Milan stock market. Comp Opn Res 23: 431–441.

    Google Scholar 

  • Mansini R and Speranza MG (1999). Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur J Opl Res 114: 219–233.

    Article  Google Scholar 

  • Rudolf M, Wolter HJ and Zimmermann H (1999). A linear model for tracking error minimization. J Banking & Fin 23: 85–103.

    Article  Google Scholar 

  • Konno H and Wijayanayake A (2001). Portfolio optimisation problem under concave transaction costs and minimal transaction unit constraints. Math Program 89: 233–250.

    Article  Google Scholar 

  • Sharpe WF, Alexander GJ and Baily JV (1999). Investments. (6th edn). Prentice-Hall: London.

    Google Scholar 

  • Hull JG (2002). Options, Futures, and Other Derivatives. (5th edn). Prentice-Hall: Upper Saddle River, NJ.

    Google Scholar 

  • Benninga S and Wiener Z (1998). Value-at-Risk (VaR). Math Edu Res 7(4): 1–7.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C Papahristodoulou.

Appendix

Appendix

See Tables A1 , A2a and A2b.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papahristodoulou, C., Dotzauer, E. Optimal portfolios using linear programming models. J Oper Res Soc 55, 1169–1177 (2004). https://doi.org/10.1057/palgrave.jors.2601765

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601765

Keywords

Navigation