Solving portfolio selection problem using Dantzig-Wolfe algorithm

Subject Areas : Journal of Investment Knowledge

Javad Behnamian ¹ , Mohammad Moshrefi ²

1 - Associate Professor, Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran (Corresponding Author)
2 - Msc, Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran

Received: 2017-06-03 Accepted : 2017-10-17 Published : 2019-06-22

Keywords: Portfolio selection problem, Dantzig-Wolf algorithm, Column generation, Convex space,

Abstract :

Portfolio selection process is one of the problems that have been attracted many researchers. Various criteria that have been applied in this case have changed over time and this situation makes necessary the using of appropriate tools to support investment decisions. The purpose of this research is modeling and solving of portfolio selection problem. On the other hand, in some cases of a portfolio optimization, due to largeness of problem size, the problem would be impossible to solve in a reasonable time. In such situation, applying the methods that reduce the scale of problem can be useful. In current paper a Dantzig-Wolfe algorithm is used to solve the problem in which, after decomposing the basic problem into several sub problems and solving them, individually, the obtained results are aggregated. The results of applying this method showed its efficiency in solving the large-scale problems show.  

References:

*      راعی، رضا. (1381)، تشکیل سبد سهام برای سرمایه‌گذار مخاطره پذیر: مقایسه‌ی شبکه‌های عصبی و مارکوویتز، مجله‌ی پیام مدیریت، 2، 2، 96-78.

شاه علی‌زاده، محمد. معماریانی، عزیزاله. (1382)، چارچوب ریاضی گزینش سبد سهام با اهداف چندگانه، بررسی‌های حسابداری و حسابرسی، مجله‌ی دانشکده‌ی مدیریت دانشگاه تهران. 32، 102-83

*      Markowitz, H., )1952 (Portfolio Selection, Journal of Finance, 7, pp. 77-91.

*      Chatsanga, N. )2017( Two-Stage Stochastic International Portfolio Optimisation under Regular-Vine-Copula-Based Scenarios.

*      Masri, H. (2015( A multiple stochastic goal programming approach for the agent portfolio selection problem, Springer Science+Business Media.

*      Pieter, K. (2016) Generating Scenario Trees for MultistageDecision Problems, Institute for Operations Research and the Management Sciences.

*      Zhai, J., Bai, M. (2018) Mean-risk model for uncertain portfolio selection with background risk, Journal of Computational and Applied Mathematics, 330, 59-69

*      Sefair, J.A., Méndez, C. Y., Babat, O., Medaglia, A.L., Zuluaga L. F. (2017) Linear solution schemes for Mean-SemiVariance Project portfolio selection problems: An application in the oil and gas industry,Omega,  68,  39-48.

*      Alexander, G. J., Baptista, A. M., Yan, S. (2017) Portfolio selection with mental accounts and estimation risk, Journal of Empirical Finance, 41, 161-186

*      Gondzio, J., Grothey, A. (2007) Solving non-linear portfolio optimization problems with the primal-dual interior point method, European Journal of Operational Research, 181, 3, 1019-1029.

*      Mansini, R., Gryczak, W., Speranza, M.G. (2003) LP solvable models for portfolio optimization: A classification and computational comparison, IMA Journal of Management Mathematics, 14, 187-220.

*      Sharp, A. (1993) Fundamental of Investments, Third Edition, Fabozzi, Investment Management, 36, 5, 139-151,835-848

*      Speranza, M. Grazia. (1995) A Heuristics Algorithm for A portfolio Optimization”, Model Applied to the Milan Stock Market, Computer & Ops Res,  5, 1, 433-441.

*      Young, M.R. (1998) A Minimum- Portfolio Selection Rule with Linear Programming Soulotion”, Management Science, Vol. 4, No. 07, PP. 673-683.