Robust optimization with belief functions

March 09, 2023 Β· Declared Dead Β· πŸ› International Journal of Approximate Reasoning

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Marc Goerigk, Romain Guillaume, Adam Kasperski, PaweΕ‚ ZieliΕ„ski arXiv ID 2303.05067 Category cs.DS: Data Structures & Algorithms Cross-listed math.OC Citations 1 Venue International Journal of Approximate Reasoning Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted