IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v35y2018i05ns0217595918500318.html
   My bibliography  Save this article

Quantitative Stability of Two-Stage Linear Second-Order Conic Stochastic Programs with Full Random Recourse

Author

Listed:
  • Qingsong Duan

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. China)

  • Mengwei Xu

    (School of Mathematics, Tianjin University, Tianjin 300072, P. R. China)

  • Shaoyan Guo

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. China)

  • Liwei Zhang

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. China)

Abstract

In this paper, we consider quantitative stability for full random two-stage linear stochastic program with second-order conic constraints when the underlying probability distribution is subjected to perturbation. We first investigate locally Lipschitz continuity of feasible set mappings of the primal and dual problems in the sense of Hausdorff distance which derives the Lipschitz continuity of the objective function, and then establish the quantitative stability results of the optimal value function and the optimal solution mapping for the perturbation problem. Finally, the obtained results are applied to the convergence analysis of optimal values and solution sets for empirical approximations of the stochastic problems.

Suggested Citation

  • Qingsong Duan & Mengwei Xu & Shaoyan Guo & Liwei Zhang, 2018. "Quantitative Stability of Two-Stage Linear Second-Order Conic Stochastic Programs with Full Random Recourse," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-24, October.
    • Handle: RePEc:wsi:apjorx:v:35:y:2018:i:05:n:s0217595918500318
    DOI: 10.1142/S0217595918500318
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595918500318
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595918500318?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. Hailin Sun & Huifu Xu, 2016. "Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 377-401, May.
    2. Svetlozar T. Rachev & Werner Römisch, 2002. "Quantitative Stability in Stochastic Programming: The Method of Probability Metrics," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 792-818, November.
    3. F. Maggioni & F. A. Potra & M. I. Bertocchi & E. Allevi, 2009. "Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks," Journal of Optimization Theory and Applications, Springer, vol. 143(2), pages 309-328, November.
    4. Sainan Zhang & Liwei Zhang & Hongwei Zhang & Qingsong Duan, 2018. "Hadamard Directional Differentiability of the Optimal Value Function of a Quadratic Programming Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-22, June.
    5. Rüdiger Schultz, 2000. "Some Aspects of Stability in Stochastic Programming," Annals of Operations Research, Springer, vol. 100(1), pages 55-84, 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. Steffen Rebennack, 2022. "Data-driven stochastic optimization for distributional ambiguity with integrated confidence region," Journal of Global Optimization, Springer, vol. 84(2), pages 255-293, October.
    2. Yongchao Liu & Huifu Xu & Jane J. Ye, 2011. "Penalized Sample Average Approximation Methods for Stochastic Mathematical Programs with Complementarity Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 670-694, November.
    3. Soonhui Lee & Tito Homem-de-Mello & Anton Kleywegt, 2012. "Newsvendor-type models with decision-dependent uncertainty," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 189-221, October.
    4. D. Kuhn, 2009. "Convergent Bounds for Stochastic Programs with Expected Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 597-618, June.
    5. Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.
    6. René Henrion & Christian Küchler & Werner Römisch, 2009. "Scenario reduction in stochastic programming with respect to discrepancy distances," Computational Optimization and Applications, Springer, vol. 43(1), pages 67-93, May.
    7. Xiaojiao Tong & Hailin Sun & Xiao Luo & Quanguo Zheng, 2018. "Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems," Journal of Global Optimization, Springer, vol. 70(1), pages 131-158, January.
    8. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    9. Amir Ahmadi-Javid & Pooya Hoseinpour, 2022. "Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2621-2633, September.
    10. Francesca Maggioni & Matteo Cagnolari & Luca Bertazzi, 2019. "The value of the right distribution in stochastic programming with application to a Newsvendor problem," Computational Management Science, Springer, vol. 16(4), pages 739-758, October.
    11. Marco Colombo & Andreas Grothey, 2013. "A decomposition-based crash-start for stochastic programming," Computational Optimization and Applications, Springer, vol. 55(2), pages 311-340, June.
    12. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    13. Vlasta Kaňková, 2013. "Risk Measures in Optimization Problems via Empirical Estimates," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 7(3), pages 162-177, November.
    14. Yongchao Liu & Huifu Xu & Gui-Hua Lin, 2012. "Stability Analysis of One Stage Stochastic Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 537-555, February.
    15. Alzalg, Baha, 2015. "Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 494-508.
    16. Trine Kristoffersen, 2005. "Deviation Measures in Linear Two-Stage Stochastic Programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(2), pages 255-274, November.
    17. Shuang Chen & Li-Ping Pang & Xue-Fei Ma & Dan Li, 2016. "SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 129-154, August.
    18. Andrew J. Keith & Darryl K. Ahner, 2021. "A survey of decision making and optimization under uncertainty," Annals of Operations Research, Springer, vol. 300(2), pages 319-353, May.
    19. Yannan Chen & Hailin Sun & Huifu Xu, 2021. "Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems," Computational Optimization and Applications, Springer, vol. 78(1), pages 205-238, January.
    20. Luca Bertazzi & Francesca Maggioni, 2015. "Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 321-342, July.

    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:wsi:apjorx:v:35:y:2018:i:05:n:s0217595918500318. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.