IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v62y2014i6p1377-1393.html
   My bibliography  Save this article

The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty

Author

Listed:
  • Erick Delage

    (Department of Decision Sciences, HEC Montréal, Montréal H3T 2A7 Canada)

  • Sharon Arroyo

    (Boeing Research and Technology, The Boeing Company, Seattle, Washington 98124)

  • Yinyu Ye

    (Department of Management Science and Engineering, Stanford University, Stanford, California 94305)

Abstract

Although stochastic programming is probably the most effective framework for handling decision problems that involve uncertain variables, it is always a costly task to formulate the stochastic model that accurately embodies our knowledge of these variables. In practice, this might require one to collect a large amount of observations, to consult with experts of the specialized field of practice, or to make simplifying assumptions about the underlying system. When none of these options seem feasible, a common heuristic has been to simply seek the solution of a version of the problem where each uncertain variable takes on its expected value (otherwise known as the solution of the mean value problem). In this paper, we show that when (1) the stochastic program takes the form of a two-stage mixed-integer stochastic linear programs, and (2) the uncertainty is limited to the objective function, the solution of the mean value problem is in fact robust with respect to the selection of a stochastic model. We also propose tractable methods that will bound the actual value of stochastic modeling: i.e., how much improvement can be achieved by investing more efforts in the resolution of the stochastic model. Our framework is applied to an airline fleet composition problem. In the three cases that are considered, our results indicate that resolving the stochastic model can not lead to more than a 7% improvement of expected profits, thus providing arguments against the need to develop these more sophisticated models.

Suggested Citation

  • Erick Delage & Sharon Arroyo & Yinyu Ye, 2014. "The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty," Operations Research, INFORMS, vol. 62(6), pages 1377-1393, December.
  • Handle: RePEc:inm:oropre:v:62:y:2014:i:6:p:1377-1393
    DOI: 10.1287/opre.2014.1318
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2014.1318
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2014.1318?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. John R. Birge & Roger J.-B. Wets, 1987. "Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 149-162, February.
    2. Stein W. Wallace, 2000. "Decision Making Under Uncertainty: Is Sensitivity Analysis of Any Use?," Operations Research, INFORMS, vol. 48(1), pages 20-25, February.
    3. Dimitris Bertsimas & Vineet Goyal, 2010. "On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 284-305, May.
    4. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    5. Dimitris Bertsimas & Xuan Vinh Doan & Karthik Natarajan & Chung-Piaw Teo, 2010. "Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 580-602, August.
    6. Laureano Escudero & Araceli Garín & María Merino & Gloria Pérez, 2007. "The value of the stochastic solution in multistage problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 48-64, July.
    7. Ovidiu Listes & Rommert Dekker, 2005. "A Scenario Aggregation–Based Approach for Determining a Robust Airline Fleet Composition for Dynamic Capacity Allocation," Transportation Science, INFORMS, vol. 39(3), pages 367-382, August.
    8. G. C. Calafiore & L. El Ghaoui, 2006. "On Distributionally Robust Chance-Constrained Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 130(1), pages 1-22, July.
    9. Daniel Ellsberg, 1961. "Risk, Ambiguity, and the Savage Axioms," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 75(4), pages 643-669.
    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. Zhang, Shichen & Zhang, Jianxiong, 2018. "Contract preference with stochastic cost learning in a two-period supply chain under asymmetric information," International Journal of Production Economics, Elsevier, vol. 196(C), pages 226-247.
    2. Silvana Pesenti & Qiuqi Wang & Ruodu Wang, 2020. "Optimizing distortion riskmetrics with distributional uncertainty," Papers 2011.04889, arXiv.org, revised Feb 2022.
    3. Liu, Yongchao & Xu, Huifu & Yang, Shu-Jung Sunny & Zhang, Jin, 2018. "Distributionally robust equilibrium for continuous games: Nash and Stackelberg models," European Journal of Operational Research, Elsevier, vol. 265(2), pages 631-643.
    4. Sun, Xiaojie & Tang, Wansheng & Zhang, Jianxiong & Chen, Jing, 2021. "The impact of quantity-based cost decline on supplier encroachment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    5. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
    6. Amir Ardestani-Jaafari & Erick Delage, 2018. "The Value of Flexibility in Robust Location–Transportation Problems," Transportation Science, INFORMS, vol. 52(1), pages 189-209, January.

    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. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    2. Corina Birghila & Tim J. Boonen & Mario Ghossoub, 2023. "Optimal insurance under maxmin expected utility," Finance and Stochastics, Springer, vol. 27(2), pages 467-501, April.
    3. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    4. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    5. 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.
    6. Postek, Krzysztof & Ben-Tal, A. & den Hertog, Dick & Melenberg, Bertrand, 2015. "Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information," Other publications TiSEM d718e419-a375-4707-b206-e, Tilburg University, School of Economics and Management.
    7. Lu, Mengshi & Nakao, Hideaki & Shen, Siqian & Zhao, Lin, 2021. "Non-profit resource allocation and service scheduling with cross-subsidization and uncertain resource consumptions," Omega, Elsevier, vol. 99(C).
    8. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    9. 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.
    10. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    11. Corina Birghila & Tim J. Boonen & Mario Ghossoub, 2020. "Optimal Insurance under Maxmin Expected Utility," Papers 2010.07383, arXiv.org.
    12. Postek, Krzysztof & Ben-Tal, A. & den Hertog, Dick & Melenberg, Bertrand, 2015. "Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information," Discussion Paper 2015-030, Tilburg University, Center for Economic Research.
    13. Karthik Natarajan & Chung Piaw Teo & Zhichao Zheng, 2011. "Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation," Operations Research, INFORMS, vol. 59(3), pages 713-728, June.
    14. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    15. Gong, Hailei & Zhang, Zhi-Hai, 2022. "Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems," European Journal of Operational Research, Elsevier, vol. 297(2), pages 496-510.
    16. Manish Bansal & Yingqiu Zhang, 2021. "Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs," Journal of Global Optimization, Springer, vol. 81(2), pages 391-433, October.
    17. 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.
    18. Zhao, Kena & Ng, Tsan Sheng & Tan, Chin Hon & Pang, Chee Khiang, 2021. "An almost robust model for minimizing disruption exposures in supply systems," European Journal of Operational Research, Elsevier, vol. 295(2), pages 547-559.
    19. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    20. Aharon Ben-Tal & Dimitris Bertsimas & David B. Brown, 2010. "A Soft Robust Model for Optimization Under Ambiguity," Operations Research, INFORMS, vol. 58(4-part-2), pages 1220-1234, August.

    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:inm:oropre:v:62:y:2014:i:6:p:1377-1393. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.