手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| 決定版混合整数計画法× | 決定版線形計画法× | |
|---|---|---|
| 分野 | シミュレーション | シミュレーション |
| 系統 | Process / pipeline | Process / pipeline |
| 提唱年≠ | 1958–1960 | 1947 |
| 提唱者≠ | Gomory, R. E.; Dantzig, G. B.; Land, A. H.; Doig, A. G. | George B. Dantzig |
| 種類≠ | Mathematical programming / combinatorial optimization | Deterministic mathematical optimization |
| 原典≠ | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York. ISBN: 9780471359432 | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 |
| 別名 | Deterministic MIP, Deterministic MILP/MIQP, Classical Mixed-Integer Programming, Deterministic MIP Optimization | Classical LP, Deterministic LP, DLP, Linear Optimization |
| 関連≠ | 6 | 5 |
| 概要≠ | Deterministic Mixed-Integer Programming (MIP) is a mathematical optimization framework that finds the provably optimal solution to problems involving both continuous and integer decision variables under fully known, fixed coefficients and constraints. It is the foundational workhorse of operations research when all data are treated as certain. | Deterministic Linear Programming (DLP) is the classical form of linear programming in which all objective function coefficients, constraint coefficients, and right-hand-side values are known with certainty. It finds the optimal allocation of resources to maximize or minimize a linear objective subject to linear constraints, providing an exact, reproducible solution under fixed, certain data. |
| ScholarGateデータセット ↗ |
|
|