definition · term 20 of 25
simplex method.
An algorithm for linear programs that moves along the edges of the feasible region from corner to corner until no neighbour is better.
worked examplecorner to cornerStart at one corner of the feasible region. Move along an edge to a neighbouring corner that improves the objective. Stop when no neighbour is better.
in plain language
George Dantzig published the simplex method in 1947. It starts at a corner of the feasible region and moves to neighbouring corners that improve the objective. Its worst case is exponential, yet it is fast in practice and remains a core part of the major LP and MIP solvers.
simplex method, 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