IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v293y2021i1p50-64.html
   My bibliography  Save this article

Maximizing perturbation radii for robust convex quadratically constrained quadratic programs

Author

Listed:
  • Yu, Pengfei
  • Gao, Ruotian
  • Xing, Wenxun

Abstract

Under the assumption that uncertain coefficients corresponding to each constraint are perturbed in an ellipsoidal set, we consider the problem of maximizing the perturbation radius of the ellipsoidal set associated to a robust convex quadratically constrained quadratic programming problem to maintain some properties of a pre-decision. To this end, a fractional programming problem is first formulated to solve the problem, and then equivalently reformulated into linear conic programs over positive semi-definite, second-order cones that are solvable in polynomial time. Numerical experiments in connection with the robust Markowitz’s portfolio selection problem are provided to demonstrate the proposed concept of sensitivity analysis. Additionally, certain numerical results are also presented to compare the efficiency of direct solutions of the proposed linear conic programs with that of a bisection method for the corresponding fractional programming problem.

Suggested Citation

  • Yu, Pengfei & Gao, Ruotian & Xing, Wenxun, 2021. "Maximizing perturbation radii for robust convex quadratically constrained quadratic programs," European Journal of Operational Research, Elsevier, vol. 293(1), pages 50-64.
    • Handle: RePEc:eee:ejores:v:293:y:2021:i:1:p:50-64
    DOI: 10.1016/j.ejor.2020.12.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720310754
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.12.032?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. Aharon Ben-Tal & Dick den Hertog & Anja De Waegenaere & Bertrand Melenberg & Gijs Rennen, 2013. "Robust Solutions of Optimization Problems Affected by Uncertain Probabilities," Management Science, INFORMS, vol. 59(2), pages 341-357, April.
    2. Harry Markowitz, 1952. "Portfolio Selection," Journal of Finance, American Finance Association, vol. 7(1), pages 77-91, March.
    3. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    4. Faiz A. Al-Khayyal & James E. Falk, 1983. "Jointly Constrained Biconvex Programming," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 273-286, May.
    5. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    6. Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 373-407, December.
    7. A. Charnes & W. W. Cooper, 1962. "Programming with linear fractional functionals," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 9(3‐4), pages 181-186, September.
    8. Areesh Mittal & Can Gokalp & Grani A. Hanasusanto, 2020. "Robust Quadratic Programming with Mixed-Integer Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 201-218, April.
    9. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    10. Dimitris Bertsimas & David B. Brown, 2009. "Constructing Uncertainty Sets for Robust Linear Optimization," Operations Research, INFORMS, vol. 57(6), pages 1483-1495, December.
    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. Fernandes, Betina & Street, Alexandre & Valladão, Davi & Fernandes, Cristiano, 2016. "An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets," European Journal of Operational Research, Elsevier, vol. 255(3), pages 961-970.
    2. Fertis, Apostolos & Baes, Michel & Lüthi, Hans-Jakob, 2012. "Robust risk management," European Journal of Operational Research, Elsevier, vol. 222(3), pages 663-672.
    3. Raphael Hauser & Vijay Krishnamurthy & Reha Tutuncu, 2013. "Relative Robust Portfolio Optimization," Papers 1305.0144, arXiv.org, revised May 2013.
    4. Mahdi Hamzeei & Alvin Lim & Jiefeng Xu, 2022. "Robust price optimization of multiple products under interval uncertainties," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 21(4), pages 442-454, August.
    5. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    6. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    7. Steve Zymler & Daniel Kuhn & Berç Rustem, 2013. "Worst-Case Value at Risk of Nonlinear Portfolios," Management Science, INFORMS, vol. 59(1), pages 172-188, July.
    8. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    9. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    10. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    11. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    12. Sehgal, Ruchika & Sharma, Amita & Mansini, Renata, 2023. "Worst-case analysis of Omega-VaR ratio optimization model," Omega, Elsevier, vol. 114(C).
    13. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    14. Karthik Natarajan & Dessislava Pachamanova & Melvyn Sim, 2008. "Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization," Management Science, INFORMS, vol. 54(3), pages 573-585, March.
    15. Jun-Ya Gotoh & Michael Jong Kim & Andrew E. B. Lim, 2017. "Calibration of Distributionally Robust Empirical Optimization Models," Papers 1711.06565, arXiv.org, revised May 2020.
    16. Selim Mankai & Khaled Guesmi, 2014. "Robust Portfolio Protection: A Scenarios-Based Approach," Working Papers hal-04141326, HAL.
    17. de Oliveira, Glauber Cardoso & Bertone, Edoardo & Stewart, Rodney A., 2022. "Optimisation modelling tools and solving techniques for integrated precinct-scale energy–water system planning," Applied Energy, Elsevier, vol. 318(C).
    18. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    19. Nicholas G. Hall & Daniel Zhuoyu Long & Jin Qi & Melvyn Sim, 2015. "Managing Underperformance Risk in Project Portfolio Selection," Operations Research, INFORMS, vol. 63(3), pages 660-675, June.
    20. Knoke, Thomas & Paul, Carola & Härtl, Fabian & Castro, Luz Maria & Calvas, Baltazar & Hildebrandt, Patrick, 2015. "Optimizing agricultural land-use portfolios with scarce data—A non-stochastic model," Ecological Economics, Elsevier, vol. 120(C), pages 250-259.

    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:eee:ejores:v:293:y:2021:i:1:p:50-64. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.