Two-stage robust mixed integer programming problem with objective uncertainty

Many real problems with uncertain parameters can be modeled as two-stage robust mixed integer programming problems (RMIPs). Due to the complex nature of this kind of problems, this paper focuses on the two-stage RMIPs with objective uncertainty. Based on the results that the augmented Lagrangian is...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization letters Ročník 12; číslo 5; s. 959 - 969
Hlavný autor: Zhang, Ning
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2018
Predmet:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Mixed integer programming
Objective uncertainty
Two-stage robust optimization
Augmented Lagrangian
ISSN:1862-4472, 1862-4480
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Many real problems with uncertain parameters can be modeled as two-stage robust mixed integer programming problems (RMIPs). Due to the complex nature of this kind of problems, this paper focuses on the two-stage RMIPs with objective uncertainty. Based on the results that the augmented Lagrangian is a strong dual for integer programming Boland and Eberhard (Math Program 150(2):491–509, 2015 ), we present the upper and lower bounds. In a special case, we show that the two-stage RMIPs can be equivalently reformulated as a solvable minimax problem.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-017-1176-z