Utility Preference Robust Optimization with Moment-Type Information Structure

Shaoyan Guo (), Huifu Xu () and Sainan Zhang ()
Additional contact information
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

Operations Research, 2024, vol. 72, issue 5, 2241-2261

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 .

Keywords: Optimization; preference robust optimization; piecewise linear approximation; non-concave utility functions; tractability; preference elicitation; MILP; error bounds; data contamination; preference inconsistency (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2023.2464 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:72:y:2024:i:5:p:2241-2261

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().