IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v155y2012i2d10.1007_s10957-012-0074-x.html
   My bibliography  Save this article

Risk-Return Trade-off with the Scenario Approach in Practice: A Case Study in Portfolio Selection

Author

Listed:
  • B. K. Pagnoncelli

    (Universidad Adolfo Ibañez)

  • D. Reich

    (Universidad Adolfo Ibañez
    Ford Research and Advanced Engineering)

  • M. C. Campi

    (University of Brescia)

Abstract

We consider the scenario approach for chance constrained programming problems. Building on existing theoretical results, effective and readily applicable methodologies to achieve suitable risk-return trade-offs are developed in this paper. Unlike other approaches, that require solving non-convex optimization problems, our methodology consists of solving multiple convex optimization problems obtained by sampling and removing some of the constraints. More specifically, two constraint removal schemes are introduced, one greedy and the other randomized, and a comparison between them is provided in a detailed computational study in portfolio selection. Other practical aspects of the procedures are also discussed. The removal schemes proposed in this paper are generalizable to a wide range of practical problems.

Suggested Citation

  • B. K. Pagnoncelli & D. Reich & M. C. Campi, 2012. "Risk-Return Trade-off with the Scenario Approach in Practice: A Case Study in Portfolio Selection," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 707-722, November.
    • Handle: RePEc:spr:joptap:v:155:y:2012:i:2:d:10.1007_s10957-012-0074-x
    DOI: 10.1007/s10957-012-0074-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0074-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-012-0074-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tanner, Matthew W. & Ntaimo, Lewis, 2010. "IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation," European Journal of Operational Research, Elsevier, vol. 207(1), pages 290-296, November.
    2. Yi Wang & Zhiping Chen & Kecun Zhang, 2007. "A CHANCE-CONSTRAINED PORTFOLIO SELECTION PROBLEM UNDERt-DISTRIBUTION," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(04), pages 535-556.
    3. Miguel Lejeune, 2011. "A VaR Black–Litterman model for the construction of absolute return fund-of-funds," Quantitative Finance, Taylor & Francis Journals, vol. 11(10), pages 1489-1501.
    4. Miguel A. Lejeune, 2012. "Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems," Operations Research, INFORMS, vol. 60(6), pages 1356-1372, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Reich, Daniel, 2013. "A linear programming approach for linear programs with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 230(3), pages 487-494.
    2. Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
    3. Algo Carè & Simone Garatti & Marco C. Campi, 2014. "FAST---Fast Algorithm for the Scenario Technique," Operations Research, INFORMS, vol. 62(3), pages 662-671, June.
    4. Ramponi, Federico Alessandro & Campi, Marco C., 2018. "Expected shortfall: Heuristics and certificates," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1003-1013.

    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. Gianpiero Canessa & Julian A. Gallego & Lewis Ntaimo & Bernardo K. Pagnoncelli, 2019. "An algorithm for binary linear chance-constrained problems using IIS," Computational Optimization and Applications, Springer, vol. 72(3), pages 589-608, April.
    2. Yongjia Song & James R. Luedtke & Simge Küçükyavuz, 2014. "Chance-Constrained Binary Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 735-747, November.
    3. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    4. Miguel A. Lejeune & François Margot, 2016. "Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities," Operations Research, INFORMS, vol. 64(4), pages 939-957, August.
    5. Zagaglia, Paolo, 2014. "International portfolio allocation with European fixed-income funds: What scope for Italian funds?," MPRA Paper 57878, University Library of Munich, Germany.
    6. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
    7. Miguel Lejeune, 2012. "Pattern definition of the p-efficiency concept," Annals of Operations Research, Springer, vol. 200(1), pages 23-36, November.
    8. Xiao Liu & Simge Küçükyavuz, 2018. "A polyhedral study of the static probabilistic lot-sizing problem," Annals of Operations Research, Springer, vol. 261(1), pages 233-254, February.
    9. Ran Ji & Miguel A. Lejeune, 2018. "Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints," Annals of Operations Research, Springer, vol. 262(2), pages 547-578, March.
    10. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    11. Wim Ackooij, 2017. "A comparison of four approaches from stochastic programming for large-scale unit-commitment," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 119-147, March.
    12. Xiaodi Bai & Jie Sun & Xiaojin Zheng, 2021. "An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1056-1069, July.
    13. Balbás, Beatriz & Balbás, Raquel, 2017. "Differential equations connecting VaR and CVaR," IC3JM - Estudios = Working Papers 24017, Instituto Mixto Carlos III - Juan March de Ciencias Sociales (IC3JM).
    14. Muckstadt, John A. & Klein, Michael G. & Jackson, Peter L. & Gougelet, Robert M. & Hupert, Nathaniel, 2023. "Efficient and effective large-scale vaccine distribution," International Journal of Production Economics, Elsevier, vol. 262(C).
    15. Lejeune, Miguel A. & Shen, Siqian, 2016. "Multi-objective probabilistically constrained programs with variable risk: Models for multi-portfolio financial optimization," European Journal of Operational Research, Elsevier, vol. 252(2), pages 522-539.
    16. 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.
    17. Lejeune, Miguel & Lozin, Vadim & Lozina, Irina & Ragab, Ahmed & Yacout, Soumaya, 2019. "Recent advances in the theory and practice of Logical Analysis of Data," European Journal of Operational Research, Elsevier, vol. 275(1), pages 1-15.
    18. Feng Qiu & Shabbir Ahmed & Santanu S. Dey & Laurence A. Wolsey, 2014. "Covering Linear Programming with Violations," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 531-546, August.
    19. Youssouf A. F. Toukourou & Franc{c}ois Dufresne, 2015. "ON Integrated Chance Constraints in ALM for Pension Funds," Papers 1503.05343, arXiv.org.
    20. Miguel A. Lejeune & Janne Kettunen, 2018. "A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting," Computational Management Science, Springer, vol. 15(3), pages 583-597, October.

    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:spr:joptap:v:155:y:2012:i:2:d:10.1007_s10957-012-0074-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.