definition · term 9 of 25
linear programming (LP).
Optimization where the objective and all constraints are linear in the decision variables.
worked exampletwo products, one cornerA plant makes two products under a machine-hours limit and a material limit. The feasible plans form a polygon, and the best plan sits on one of its corners.
in plain language
Linear programming is one of the most widely used optimization techniques. It applies when the goal and every rule can be written as linear expressions. The simplex method and interior point methods solve LPs efficiently even with millions of variables, and the solution comes with shadow prices for every constraint.
linear 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