The reviewed record of science sign in
Pith

arxiv: 2303.05067 · v1 · pith:ONRWAG7S · submitted 2023-03-09 · cs.DS · math.OC

Robust optimization with belief functions

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ONRWAG7Srecord.jsonopen to challenge →

classification cs.DS math.OC
keywords functionbeliefcoefficientsobjectiveoptimizationproblemscenarioadmissible
0
0 comments X
read the original abstract

In this paper, an optimization problem with uncertain objective function coefficients is considered. The uncertainty is specified by providing a discrete scenario set, containing possible realizations of the objective function coefficients. The concept of belief function in the traditional and possibilistic setting is applied to define a set of admissible probability distributions over the scenario set. The generalized Hurwicz criterion is then used to compute a solution. In this paper, the complexity of the resulting problem is explored. Some exact and approximation methods of solving it are proposed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.