방법 비교

	강건 정수 계획법	강건 선형 계획법
분야	시뮬레이션	시뮬레이션
계열	Process / pipeline	Process / pipeline
기원 연도	2003	1999–2004
창시자	Bertsimas, D. and Sim, M.	Ben-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M.
유형	Deterministic robust optimization with integer variables	Uncertainty-robust linear optimization
원전	Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71.	Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
별칭	RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization	RLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP
관련	6	5
요약	Robust Integer Programming (RIP) finds integer or binary solutions that remain feasible and near-optimal across all scenarios in a prescribed uncertainty set. Rather than assuming exact knowledge of data, RIP hedges against the worst-case realization of uncertain costs or constraint coefficients, delivering decisions that are guaranteed to perform well even when inputs deviate from their nominal values.	Robust Linear Programming (RLP) extends classical linear programming to handle uncertainty in problem data — cost coefficients, constraint coefficients, or right-hand sides — by requiring solutions to remain feasible and near-optimal across all realizations of uncertain parameters within a defined uncertainty set. It replaces probabilistic assumptions with worst-case guarantees, making it practical when distributional knowledge is limited.