1 January 2023 in Operations Research
We present a general framework for robust satisficing that favors solutions for which a risk-aware objective function would best attain an acceptable target even when the actual probability distribution deviates from the empirical distribution. The satisficing decision maker specifies an acceptable target, or loss of optimality compared with the empirical optimization model, as a trade-off for the model’s ability to withstand greater uncertainty. We axiomatize the decision criterion associated with robust satisficing, termed as the fragility measure, and present its representation theorem. Focusing on Wasserstein distance measure, we present tractable robust satisficing models for risk-based linear optimization, combinatorial optimization, and linear optimization problems with recourse. Serendipitously, the insights to the approximation of the linear optimization problems with recourse also provide a recipe for approximating solutions for hard stochastic optimization problems without relatively complete recourse. We perform numerical studies on a portfolio optimization problem and a network lot-sizing problem. We show that the solutions to the robust satisficing models are more effective in improving the out-of-sample performance evaluated on a variety of metrics, hence alleviating the optimizer’s curse. Funding: D. Z. Long is supported by the Hong Kong Research Grants Council [Grant 14207819]. M. Sim and M. Zhou are supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 [Grant MOE-2019-T3-1-010]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/opre.2021.2238 .
1 March 2024 in Management Science
In this paper, we solve a class of two-stage distributionally robust optimization problems that have the property of supermodularity. We exploit the explicit worst case expectation of supermodular functions and derive the worst case distribution for the robust counterpart. This enables us to develop an efficient method to obtain an exact optimal solution to these two-stage problems. Further, we provide a necessary and sufficient condition for checking whether any given two-stage optimization problem has the supermodularity property. We also investigate the optimality of the segregated affine decision rules when problems have the property of supermodularity. We apply this framework to several classic problems, including the multi-item newsvendor problem, the facility location problem, the lot-sizing problem on a network, the appointment-scheduling problem, and the assemble-to-order problem. Whereas these problems are typically computationally challenging, they can be solved efficiently under our assumptions. Finally, numerical examples are conducted to illustrate the effectiveness of our approach. This paper was accepted by Chung Piaw Teo, optimization. Funding: This work was supported by the National Natural Science Foundation of China [Grant 71971187], and Hong Kong Research Grants Council [Collaborative Research Fund (C6103-20GF), General Research Fund (14210821, 16204521, 16212419)]. Supplemental Material: The online appendix and data are available at https://doi.org/10.1287/mnsc.2023.4748 .
1 January 2023 in Operations Research
In the inventory routing problem, the supplier acts as a central decision maker who determines the replenishment quantities and also, the delivery times and routes to all retailers. In “Inventory Routing Problem Under Uncertainty”, Cui et al. develop a novel framework for the uncertain inventory routing problem and allow ambiguity in the probability distribution of each retailer's uncertain demand. Adopting a service-level viewpoint, they minimize the risk of uncertain inventory levels violating a prespecified acceptable range. They quantify that risk using a new decision criterion, the service violation index, that accounts for how often and how severely the inventory requirement is violated. The solutions proposed here are adaptive in the sense that they vary with the realization of uncertain demand. They provide algorithms to solve the problem exactly and then, demonstrate the superiority of their solutions by comparing them with several benchmarks.
27 July 2020 in Annals of Operations Research
1 January 2021 in Operations Research
The concept of supermodularity has received considerable attention in economics and operations research. It is closely related to the concept of complementarity in economics and has also proved to be an important tool for deriving monotonic comparative statics in parametric optimization problems and game theory models. However, only certain sufficient conditions (e.g., lattice structure) are identified in the literature to preserve the supermodularity. In this article, new concepts of mostly sublattice and additive mostly sublattice are introduced. With these new concepts, necessary and sufficient conditions for the constraint structures are established so that supermodularity can be preserved under various assumptions about the objective functions. Furthermore, some classes of polyhedral sets that satisfy these concepts are identified, and the results are applied to assemble-to-order systems.
4 June 2025 in Transportation Research Part E: Logistics and Transportation Review