방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

강건 혼합 정수 계획법×불확실성 하에서 안정적인 파레토 최적 해를 찾는 강건 다목적 최적화×
분야시뮬레이션시뮬레이션
계열Process / pipelineProcess / pipeline
기원 연도1998–20042006
창시자Ben-Tal & Nemirovski; Bertsimas & SimDeb, K. & Gupta, H.
유형Deterministic robust reformulation of MIP under uncertaintyOptimization framework
원전Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463–494. DOI ↗
별칭RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQPRMOO, Robust MOO, Robust Pareto Optimization, Uncertainty-Robust Multi-Objective Optimization
관련44
요약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.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 Download slides

ScholarGate방법 비교: Robust Mixed-Integer Programming · Robust Multi-Objective Optimization. 2026-06-15에 다음에서 검색함: https://scholargate.app/ko/compare