.png){kind=icon}
Return
Distributionally robust possibilistic optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.fss.2022.05.007.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper a class of optimization problems with uncertain linear constraints is discussed. It is assumed that the constraint coefficients are random vectors whose probability distributions are only partially known. Possibility theory is used to model imprecise probabilities. In one of interpretation, a possibility distribution (a membership function of a fuzzy set) in the set of coefficient realizations induces a necessity measure, which in turn defines a family of probability distributions in this set. The distributionally robust approach is then used to transform the imprecise constraints into deterministic counterparts. Namely, the uncertain left-hand side of each constraint is replaced with the expected value with respect to the worst probability distribution that can occur. It is shown how to represent the resulting problem by using linear or second-order cone constraints. This leads to problems which are computationally tractable for a wide class of optimization models, in particular for linear programming. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Robust optimization
Possibility theory
Imprecise probabilities
Fuzzy intervals
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveEffects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
ShareSaveShareSave
View more