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

Utility Preference Robust Optimization with Moment-Type Information Structure

Author

Listed:
  • Shaoyan Guo

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

  • Huifu Xu

    (Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong)

  • Sainan Zhang

    (Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong)

Abstract

Utility preference robust optimization (PRO) models have recently been proposed to deal with decision-making problems where the decision-maker’s true utility function is unknown and the optimal decision is based on the worst-case utility function in an ambiguity set of utility functions. In this paper, we consider the case where the ambiguity set is constructed using some moment-type conditions. We propose piecewise linear approximation of the utility functions in the ambiguity set. The approximate maximin problem can be solved directly by derivative-free methods when the utility functions are nonconcave. Alternatively, we can reformulate the approximate problem as a single mixed integer linear program (MILP) and solve the MILP by existing solvers such as Gurobi. To justify the approximation scheme, we derive error bounds for the approximate ambiguity set, the optimal value and optimal solutions of the approximate maximin problem. To address the data perturbation/contamination issues arising from the construction of the ambiguity set, we derive some stability results which quantify the variation of the ambiguity set against perturbations in the elicitation data and its propagation to the optimal value and optimal solutions of the PRO model. Moreover, we extend the PRO models to allow some inconsistencies in the process of eliciting the decision-maker’s preferences. Finally, we carry out numerical tests to evaluate the performances of the proposed numerical schemes and show that the computational schemes work fairly efficiently, the PRO model is resilient against small perturbations in data (with respect to both exogenous uncertainty data and preference elicitation data), and there is a potential to improve the efficiency of the preference elicitation by incorporating an optimal selection strategy. Funding: This project is supported by Hong Kong RGC [Grant 14500620] and The Chinese University of Hong Kong start-up grant. The research of S. Guo is supported by the National Key R&D Program of China [Grant 2022YFA1004000] and the Natural Science Foundation of China [Grant 12271077]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/opre.2023.2464 .

Suggested Citation

  • Shaoyan Guo & Huifu Xu & Sainan Zhang, 2024. "Utility Preference Robust Optimization with Moment-Type Information Structure," Operations Research, INFORMS, vol. 72(5), pages 2241-2261, September.
  • Handle: RePEc:inm:oropre:v:72:y:2024:i:5:p:2241-2261
    DOI: 10.1287/opre.2023.2464
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.2023.2464?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:72:y:2024:i:5:p:2241-2261. 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.