definition · term 10 of 25
mixed-integer programming (MIP).
Optimization where some or all variables must take whole-number values, used for yes or no decisions, scheduling and routing.
worked exampleopen the depot or notA depot is either opened or not: a yes or no variable. Flows from each depot are continuous. MIP handles both in one model and still reports a bound.
in plain language
Mixed-integer programming extends linear programming with integer variables. Real decisions often need them: does this truck visit this stop, how many cranes go to this berth, which warehouse ships the order. MIP problems are NP-hard in general and are solved with branch and bound and cutting planes.
mixed-integer programming, on your own decision.
Bring one recurring decision. Your planners see the terms of this glossary applied to their own rules and data.
- Glossary
- all 25 terms, a to z
- Problem types
- the decisions kint solves
- Comparisons
- kint next to other approaches
- Contact
- hello@kint.pro