Robust concave utility maximization over chance constraints

Shanshan Wang, Sanjay Mehrotra and Chun Peng

European Journal of Operational Research, 2025, vol. 321, issue 3, 800-813

Abstract: This paper first studies an expected utility problem with chance constraints and incomplete information on a decision maker’s utility function. The model maximizes the worst-case expected utility of random outcome over a set of concave functions within a novel ambiguity set, while the underlying probability distribution is known with the assumption of a discretization of possible realizations for the uncertainty parameter. To obtain computationally tractable formulations, we employ a discretization approach to derive a max–min chance-constrained approximation of this problem. This approximation is further reformulated as a mixed-integer program. We show that the discrete approximation converges to the true counterpart under mild assumptions. We also present a row generation algorithm for optimizing the max–min program. A computational study for a bin-packing problem and a multi-item newsvendor problem is conducted to demonstrate the benefit of the proposed framework and the computational efficiency of our algorithm. We find that the row generation algorithm can significantly reduce the computational time, and our robust policy could achieve a better out-of-sample performance when compared with the non-robust policy and the one without the chance constraints.

Keywords: Discrete optimization; Robust expected utility; Chance constraint; Bin packing; Multi-item newsvendor (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724007604
Full text for ScienceDirect subscribers only

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:eee:ejores:v:321:y:2025:i:3:p:800-813

DOI: 10.1016/j.ejor.2024.10.007

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().