Jämför metoder

	Robust Mixed-Integer Programming	Robust Multi-Objective Optimization
Ämnesområde	Simulering	Simulering
Familj	Process / pipeline	Process / pipeline
Ursprungsår	1998–2004	2006
Upphovsperson	Ben-Tal & Nemirovski; Bertsimas & Sim	Deb, K. & Gupta, H.
Typ	Deterministic robust reformulation of MIP under uncertainty	Optimization framework
Ursprungskälla	Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.	Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463–494.
Alias	RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP	RMOO, Robust MOO, Robust Pareto Optimization, Uncertainty-Robust Multi-Objective Optimization
Närliggande	4	4
Sammanfattning	Robust Mixed-Integer Programming (RMIP) combines mixed-integer programming with robust optimization to find solutions that remain feasible and near-optimal despite uncertain parameters. Instead of assuming fixed data, it protects decisions against adversarial or worst-case realizations of uncertain inputs, using an explicit uncertainty set to control the degree of conservatism while preserving the combinatorial structure of integer decisions.	Robust Multi-Objective Optimization (RMOO) is a framework for finding solutions that simultaneously optimize multiple conflicting objectives while remaining insensitive to perturbations in decision variables or problem parameters. Unlike classical MOO, RMOO explicitly incorporates uncertainty into the optimization loop, producing a robust Pareto front whose members perform well not only at the nominal design point but also across a neighbourhood of plausible operating conditions.