A framework of distributionally robust possibilistic optimization
Romain Guillaume, Adam Kasperski, Pawel Zielinski

TL;DR
This paper develops a distributionally robust optimization framework using possibilistic modeling and Conditional Value at Risk to handle uncertain constraints, providing a general approach with some polynomial-time solvable cases.
Contribution
It introduces a novel framework combining possibilistic uncertainty with distributionally robust optimization using CVaR, extending existing methods.
Findings
Framework effectively models uncertainty with possibility theory.
Some problem cases are solvable in polynomial time.
The approach generalizes robust and expected value methods.
Abstract
In this paper, an optimization problem with uncertain constraint coefficients is considered. Possibility theory is used to model the uncertainty. Namely, a joint possibility distribution in constraint coefficient realizations, called scenarios, is specified. This possibility distribution induces a necessity measure in scenario set, which in turn describes an ambiguity set of probability distributions in scenario set. The distributionally robust approach is then used to convert the imprecise constraints into deterministic equivalents. Namely, the left-hand side of an imprecise constraint is evaluated by using a risk measure with respect to the worst probability distribution that can occur. In this paper, the Conditional Value at Risk is used as the risk measure, which generalizes the strict robust and expected value approaches, commonly used in literature. A general framework for solving…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWater resources management and optimization · Risk and Portfolio Optimization · Optimization and Mathematical Programming
