Process / pipelineSimulation / optimization
确定性整数规划 — 使用整数决策变量进行精确优化
确定性整数规划（DIP）是一种数学优化方法，用于在决策变量部分或全部必须取整数值的问题中找到最佳解决方案，前提是目标和约束数据完全已知（确定性）。它是整数规划的经典、非随机形式，自20世纪50年代末以来一直是运筹学和组合优化的基础。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64(5), 275-278. DOI: 10.1090/S0002-9904-1958-10224-4 ↗
- Wolsey, L. A. (1998). Integer Programming. Wiley-Interscience, New York. ISBN: 9780471283669
如何引用本页
ScholarGate. (2026, June 3). Deterministic Integer Programming. ScholarGate. https://scholargate.app/zh/simulation/deterministic-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 side by side →