方法证据记录

Mixed-Integer Programming

Mixed-Integer Programming (MIP) is a mathematical optimization framework in which some decision variables must take integer values while others may be continuous. It generalizes linear programming and is widely used in operations research, logistics, scheduling, resource allocation, and engineering design, where indivisibility constraints — such as yes/no decisions or whole-unit quantities — arise naturally.

Sources recorded, not reviewed

源记录

引文逐字复制自方法源记录。这些引文不代表任何层级的验证。

Mixed-Integer Programming (MIP) — Mathematical optimization with continuous and integer decision variables

分类方法记录 · process-pipeline / simulation

Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. Wiley-Interscience, New York. · ISBN 9780471359432
Wolsey, L. A. (1998). Integer Programming. Wiley-Interscience, New York. · ISBN 9780471283669

打开完整方法

精选声明

声明已持久化到证据分类账中，每个声明都有自己的评估。

尚无精选声明

当分类账中没有声明时，此视图不会自行创建声明评估。

相关方法

从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。

Same method familyBranch and Boundmachine-suggested · Relational suggestion, not evidence.Same method familyDynamic Programmingmachine-suggested · Relational suggestion, not evidence.Same method familyGenetic Algorithmmachine-suggested · Relational suggestion, not evidence.Same method familyLinear Programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketMulti-objective mixed-integer programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketStochastic Mixed-Integer Programmingmachine-suggested · Relational suggestion, not evidence.