IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i3p1459-1478.html

Robust CARA Optimization

Author

Listed:
  • Li Chen

    (Discipline of Business Analytics, The University of Sydney, Sydney, New South Wales 2006, Australia)

  • Melvyn Sim

    (Department of Analytics & Operations, NUS Business School, National University of Singapore, Singapore 119245)

Abstract

We propose robust optimization models and their tractable approximations that cater for ambiguity-averse decision makers whose underlying risk preferences are consistent with constant absolute risk aversion (CARA). Specifically, we focus on maximizing the worst-case expected exponential utility where the underlying uncertainty is generated from a set of stochastically independent factors with ambiguous marginals. To obtain computationally tractable formulations, we propose a hierarchy of approximations, starting from formulating the objective function as tractable concave functions in affinely perturbed cases, developing approximations in concave piecewise affinely perturbed cases, and proposing new multideflected linear decision rules for adaptive optimization models. We also extend the framework to address a multiperiod consumption model. The resultant models would take the form of an exponential conic optimization problem (ECOP), which can be practicably solved using current off-the-shelf solvers. We present numerical examples including project management and multiperiod inventory management with financing to illustrate how our approach can be applied to obtain high-quality solutions that could outperform current stochastic optimization approaches, especially in situations with high risk aversion levels.

Suggested Citation

  • Li Chen & Melvyn Sim, 2025. "Robust CARA Optimization," Operations Research, INFORMS, vol. 73(3), pages 1459-1478, May.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:3:p:1459-1478
    DOI: 10.1287/opre.2021.0654
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.2021.0654?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. Herbert A. Simon, 1955. "A Behavioral Model of Rational Choice," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 69(1), pages 99-118.
    2. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    3. Renaud Chicoisne & Fernando Ordóñez & Daniel Espinoza, 2018. "Risk Averse Shortest Paths: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 539-553, August.
    4. 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.
    5. Laurent El Ghaoui & Maksim Oks & Francois Oustry, 2003. "Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach," Operations Research, INFORMS, vol. 51(4), pages 543-556, August.
    6. Ioana Popescu, 2007. "Robust Mean-Covariance Solutions for Stochastic Optimization," Operations Research, INFORMS, vol. 55(1), pages 98-112, February.
    7. Dimitris Bertsimas & Ioana Popescu, 2002. "On the Relation Between Option and Stock Prices: A Convex Optimization Approach," Operations Research, INFORMS, vol. 50(2), pages 358-374, April.
    8. Mokrane Bouakiz & Matthew J. Sobel, 1992. "Inventory Control with an Exponential Utility Criterion," Operations Research, INFORMS, vol. 40(3), pages 603-608, June.
    9. Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
    10. James E. Smith & Robert L. Winkler, 2006. "The Optimizer's Curse: Skepticism and Postdecision Surprise in Decision Analysis," Management Science, INFORMS, vol. 52(3), pages 311-322, March.
    11. Holmstrom, Bengt & Milgrom, Paul, 1991. "Multitask Principal-Agent Analyses: Incentive Contracts, Asset Ownership, and Job Design," The Journal of Law, Economics, and Organization, Oxford University Press, vol. 7(0), pages 24-52, Special I.
    12. Ronald A. Howard & James E. Matheson, 1972. "Risk-Sensitive Markov Decision Processes," Management Science, INFORMS, vol. 18(7), pages 356-369, March.
    13. 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.
    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. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    16. Yu Zhang & Zhenzhen Zhang & Andrew Lim & Melvyn Sim, 2021. "Robust Data-Driven Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 69(2), pages 469-485, March.
    17. 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.
    18. Quiggin, John, 1982. "A theory of anticipated utility," Journal of Economic Behavior & Organization, Elsevier, vol. 3(4), pages 323-343, December.
    19. Xin Chen & Yuhan Zhang, 2009. "Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts," Operations Research, INFORMS, vol. 57(6), pages 1469-1482, December.
    20. Craig W. Kirkwood, 2004. "Approximating Risk Aversion in Decision Analysis Applications," Decision Analysis, INFORMS, vol. 1(1), pages 51-67, March.
    21. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    22. David Laibson, 1997. "Golden Eggs and Hyperbolic Discounting," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 112(2), pages 443-478.
    23. Gilboa, Itzhak & Schmeidler, David, 1989. "Maxmin expected utility with non-unique prior," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 141-153, April.
    24. Xin Chen & Melvyn Sim & Peng Sun, 2007. "A Robust Optimization Perspective on Stochastic Programming," Operations Research, INFORMS, vol. 55(6), pages 1058-1071, December.
    25. Mehra, Rajnish & Prescott, Edward C., 1985. "The equity premium: A puzzle," Journal of Monetary Economics, Elsevier, vol. 15(2), pages 145-161, March.
    26. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    27. Veronesi, Pietro, 1999. "Stock Market Overreaction to Bad News in Good Times: A Rational Expectations Equilibrium Model," The Review of Financial Studies, Society for Financial Studies, vol. 12(5), pages 975-1007.
    28. Xin Chen & Melvyn Sim & Peng Sun & Jiawei Zhang, 2008. "A Linear Decision-Based Approximation Approach to Stochastic Programming," Operations Research, INFORMS, vol. 56(2), pages 344-357, April.
    29. 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.
    30. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    31. Kydland, Finn E & Prescott, Edward C, 1977. "Rules Rather Than Discretion: The Inconsistency of Optimal Plans," Journal of Political Economy, University of Chicago Press, vol. 85(3), pages 473-491, June.
    32. Chuen-Teck See & Melvyn Sim, 2010. "Robust Approximation to Multiperiod Inventory Management," Operations Research, INFORMS, vol. 58(3), pages 583-594, June.
    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. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    2. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    3. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    4. Daniel Zhuoyu Long & Melvyn Sim & Minglong Zhou, 2023. "Robust Satisficing," Operations Research, INFORMS, vol. 71(1), pages 61-82, January.
    5. Yongzhen Li & Xueping Li & Jia Shu & Miao Song & Kaike Zhang, 2022. "A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 407-426, January.
    6. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    7. 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.
    8. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    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. Napat Rujeerapaiboon & Daniel Kuhn & Wolfram Wiesemann, 2016. "Robust Growth-Optimal Portfolios," Management Science, INFORMS, vol. 62(7), pages 2090-2109, July.
    11. Zheng Cui & Daniel Zhuoyu Long & Jin Qi & Lianmin Zhang, 2023. "The Inventory Routing Problem Under Uncertainty," Operations Research, INFORMS, vol. 71(1), pages 378-395, January.
    12. Li Chen & Chenyi Fu & Fan Si & Melvyn Sim & Peng Xiong, 2025. "Robust Optimization with Moment-Dispersion Ambiguity," Operations Research, INFORMS, vol. 73(6), pages 3118-3138, November.
    13. Daniel Zhuoyu Long & Jin Qi & Aiqi Zhang, 2024. "Supermodularity in Two-Stage Distributionally Robust Optimization," Management Science, INFORMS, vol. 70(3), pages 1394-1409, March.
    14. Han, Biao & Shang, Chao & Huang, Dexian, 2021. "Multiple kernel learning-aided robust optimization: Learning algorithm, computational tractability, and usage in multi-stage decision-making," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1004-1018.
    15. Walid Ben-Ameur & Adam Ouorou & Guanglei Wang & Mateusz Żotkiewicz, 2018. "Multipolar robust optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 395-434, December.
    16. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2026. "On the Optimality of Affine Decision Rules in Distributionally Robust Optimization," Management Science, INFORMS, vol. 72(2), pages 1456-1471, February.
    17. Ding, Yi & Zhang, Linjing & Kuo, Yong-Hong & Zhang, Lianmin, 2025. "Cold chain routing for product freshness and low carbon emissions: A target-oriented robust optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 199(C).
    18. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    19. Dimitris Bertsimas & Shimrit Shtern & Bradley Sturt, 2022. "Technical Note—Two-Stage Sample Robust Optimization," Operations Research, INFORMS, vol. 70(1), pages 624-640, January.
    20. Eojin Han & Omid Nohadani, 2025. "Nonlinear Decision Rules Made Scalable by Nonparametric Liftings," Management Science, INFORMS, vol. 71(4), pages 3449-3471, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:inm:oropre:v:73:y:2025:i:3:p:1459-1478. 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.