IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0213652.html
   My bibliography  Save this article

A portfolio selection model based on the knapsack problem under uncertainty

Author

Listed:
  • Fereshteh Vaezi
  • Seyed Jafar Sadjadi
  • Ahmad Makui

Abstract

One of the primary concerns in investment planning is to determine the number of shares for asset with relatively high net value of share such as Berkshire Hathaway on Stock market. Traditional asset allocation methods like Markowitz theorem gives the solution as a percentage and this ratio may suggest allocation of half of a share on the market, which is impractical. Thus, it is necessary to propose a method to determine the number of shares for each asset. This paper presents a knapsack based portfolio selection model where the expected returns, prices, and budget are characterized by interval values. The study determines the priority and importance of each share in the proposed model by extracting the interval weights from an interval comparison matrix. The resulted model is converted into a parametric linear programming model in which the decision maker is able to determine the optimism threshold. Finally, a discrete firefly algorithm is designed to find the near optional solutions in large dimensions. The proposed study is implemented for some data from the US stock exchange.

Suggested Citation

  • Fereshteh Vaezi & Seyed Jafar Sadjadi & Ahmad Makui, 2019. "A portfolio selection model based on the knapsack problem under uncertainty," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-19, May.
    • Handle: RePEc:plo:pone00:0213652
    DOI: 10.1371/journal.pone.0213652
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0213652
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0213652&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0213652?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Li, Han-Lin & Tsai, Jung-Fa, 2008. "A distributed computation algorithm for solving portfolio problems with integer variables," European Journal of Operational Research, Elsevier, vol. 186(2), pages 882-891, April.
    2. Sugihara, Kazutomi & Ishii, Hiroaki & Tanaka, Hideo, 2004. "Interval priorities in AHP by interval regression analysis," European Journal of Operational Research, Elsevier, vol. 158(3), pages 745-754, November.
    3. Giove, Silvio & Funari, Stefania & Nardelli, Carla, 2006. "An interval portfolio selection problem based on regret function," European Journal of Operational Research, Elsevier, vol. 170(1), pages 253-264, April.
    4. P. Bonami & M. A. Lejeune, 2009. "An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints," Operations Research, INFORMS, vol. 57(3), pages 650-670, June.
    5. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "A new method for mean-variance portfolio optimization with cardinality constraints," Annals of Operations Research, Springer, vol. 205(1), pages 213-234, May.
    6. Corazza, Marco & Favaretto, Daniela, 2007. "On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1947-1960, February.
    7. Yong-Jun Liu & Wei-Guo Zhang & Jun-Bo Wang, 2016. "Multi-period cardinality constrained portfolio selection models with interval coefficients," Annals of Operations Research, Springer, vol. 244(2), pages 545-569, September.
    8. Li, Xiang & Qin, Zhongfeng, 2014. "Interval portfolio selection models within the framework of uncertainty theory," Economic Modelling, Elsevier, vol. 41(C), pages 338-344.
    9. Duan Li & Xiaoling Sun & Jun Wang, 2006. "Optimal Lot Solution To Cardinality Constrained Mean–Variance Formulation For Portfolio Selection," Mathematical Finance, Wiley Blackwell, vol. 16(1), pages 83-101, January.
    10. Wang, Ying-Ming & Elhag, Taha M.S., 2007. "A goal programming method for obtaining interval weights from an interval comparison matrix," European Journal of Operational Research, Elsevier, vol. 177(1), pages 458-471, February.
    11. D. Goldfarb & G. Iyengar, 2003. "Robust Portfolio Selection Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 1-38, February.
    12. Pierre Bonami & Miguel A. Lejeune, 2009. "An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints," Post-Print hal-00421756, HAL.
    13. Dumas, Bernard & Luciano, Elisa, 1991. "An Exact Solution to a Dynamic Portfolio Choice Problem under Transactions Costs," Journal of Finance, American Finance Association, vol. 46(2), pages 577-595, June.
    14. Castro, F. & Gago, J. & Hartillo, I. & Puerto, J. & Ucha, J.M., 2011. "An algebraic approach to integer portfolio problems," European Journal of Operational Research, Elsevier, vol. 210(3), pages 647-659, May.
    15. Kolm, Petter N. & Tütüncü, Reha & Fabozzi, Frank J., 2014. "60 Years of portfolio optimization: Practical challenges and current trends," European Journal of Operational Research, Elsevier, vol. 234(2), pages 356-371.
    16. Liu, Yong-Jun & Zhang, Wei-Guo & Zhang, Pu, 2013. "A multi-period portfolio selection optimization model by using interval analysis," Economic Modelling, Elsevier, vol. 33(C), pages 113-119.
    17. MOSSIN, Jan, 1968. "Optimal multiperiod portfolio policies," LIDAM Reprints CORE 19, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jongbin Jung & Seongmoon Kim, 2017. "Developing a dynamic portfolio selection model with a self-adjusted rebalancing method," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 766-779, July.
    2. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    3. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.
    4. Zhou, Zhongbao & Jin, Qianying & Xiao, Helu & Wu, Qian & Liu, Wenbin, 2018. "Estimation of cardinality constrained portfolio efficiency via segmented DEA," Omega, Elsevier, vol. 76(C), pages 28-37.
    5. Yuanyuan Zhang & Xiang Li & Sini Guo, 2018. "Portfolio selection problems with Markowitz’s mean–variance framework: a review of literature," Fuzzy Optimization and Decision Making, Springer, vol. 17(2), pages 125-158, June.
    6. Jianjun Gao & Duan Li, 2013. "Optimal Cardinality Constrained Portfolio Selection," Operations Research, INFORMS, vol. 61(3), pages 745-761, June.
    7. Ran Ji & Miguel A. Lejeune, 2021. "Data-Driven Optimization of Reward-Risk Ratio Measures," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1120-1137, July.
    8. P. Kumar & Jyotirmayee Behera & A. K. Bhurjee, 2022. "Solving mean-VaR portfolio selection model with interval-typed random parameter using interval analysis," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 41-77, March.
    9. Xiaojin Zheng & Xiaoling Sun & Duan Li, 2014. "Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 690-703, November.
    10. Natalie Ramírez Carmona & Oswaldo García Salgado, 2016. "State of the art in portfolio theory: the individual analysis of actions to the multiobjective optimization. Estado del arte en teoría de portafolios: del análisis individual de acciones a la optimiza," Economia Coyuntural,Revista de temas de perspectivas y coyuntura, Instituto de Investigaciones Economicas y Sociales 'Jose Ortiz Mercado' (IIES-JOM), Facultad de Ciencias Economicas, Administrativas y Financieras, Universidad Autonoma Gabriel Rene Moreno, vol. 1(4), pages 101-144.
    11. Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun, 2014. "Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 379-397, October.
    12. Tiago P. Filomena & Miguel A. Lejeune, 2014. "Warm-Start Heuristic for Stochastic Portfolio Optimization with Fixed and Proportional Transaction Costs," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 308-329, April.
    13. Gili Rosenberg & Poya Haghnegahdar & Phil Goddard & Peter Carr & Kesheng Wu & Marcos L'opez de Prado, 2015. "Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer," Papers 1508.06182, arXiv.org, revised Aug 2016.
    14. Kay Giesecke & Baeho Kim & Jack Kim & Gerry Tsoukalas, 2014. "Optimal Credit Swap Portfolios," Management Science, INFORMS, vol. 60(9), pages 2291-2307, September.
    15. P. Bonami & M. A. Lejeune, 2009. "An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints," Operations Research, INFORMS, vol. 57(3), pages 650-670, June.
    16. Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Twenty years of linear programming based portfolio optimization," European Journal of Operational Research, Elsevier, vol. 234(2), pages 518-535.
    17. Kyle Steinhauer & Takahisa Fukadai & Sho Yoshida, 2020. "Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation," Papers 2009.08412, arXiv.org.
    18. Miguel A. Lejeune & Gülay Samatlı-Paç, 2013. "Construction of Risk-Averse Enhanced Index Funds," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 701-719, November.
    19. Zhang, Xili & Zhang, Weiguo & Xiao, Weilin, 2013. "Multi-period portfolio optimization under possibility measures," Economic Modelling, Elsevier, vol. 35(C), pages 401-408.
    20. Vladimir Cherny & Jan Obloj, 2013. "Optimal portfolios of a long-term investor with floor or drawdown constraints," Papers 1305.6831, arXiv.org.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0213652. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.