Process / pipelineSimulation / optimization
鲁棒整数规划 — 不确定性下的整数约束优化
鲁棒整数规划（RIP）旨在寻找在给定不确定性集合的所有场景下都可行且接近最优的整数或二元解。RIP不假设对数据有精确的了解，而是对不确定的成本或约束系数的最坏情况实现进行对冲，从而在输入偏离其标称值时也能保证良好的决策表现。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71. DOI: 10.1007/s10107-003-0396-4 ↗
- Ben-Tal, A., El Ghaoui, L., Nemirovski, A. (2009). Robust Optimization. Princeton University Press, Princeton, NJ. ISBN: 9780691143682
如何引用本页
ScholarGate. (2026, June 3). Robust Integer Programming — Optimization under uncertainty with integrality constraints. ScholarGate. https://scholargate.app/zh/simulation/robust-integer-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 整数规划优化↔ compare
- 混合整数规划仿真↔ compare
- 鲁棒线性规划仿真↔ compare
- 鲁棒混合整数规划仿真↔ compare
- 鲁棒多目标优化仿真↔ compare
- 随机整数规划仿真↔ compare