Robust two-stage optimization consensus models with uncertain costs

doi:10.1016/j.ejor.2024.04.020

Robust two-stage optimization consensus models with uncertain costs

2024-09-01

1

PRE

AI

DOI：10.1016/j.ejor.2024.04.020

Original

Original request for help

Save

Abstract

En 中文

In the consensus -reaching process (CRP), decision -makers (DMs) frequently encounter the dilemma of too much uncertain information, which can lead the actual decision to deviate from the optimal solution obtained by the currently used consensus models. To do this, we construct two robust two -stage optimization consensus models with uncertain costs and obtain their robust two -stage counterparts. We then apply a Benders decomposition algorithm to solve the resulting models. Finally, the experimental results show that the new models are better suited for uncertain contexts and could help DMs produce more reliable choices.

Keywords:

(S) group decisions and negotiations

Minimum cost consensus

Two-stage stochastic programming

Robust optimization

Robust two-stage optimization consensus models with uncertain costs

Abstract

Journal

Organization