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

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
    ---><---

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.