Linked Data Explorerhttp://worldcat.org/entity/work/id/4216519
The simplex method
The simplex method of solution of a linear program first transforms the original system to an equivalent system of m equations in canonical form by an elimination of m of the n unknowns. If the right choice of m variables is made, then by equating the remaining variables to zero, an optimal solution is obtained to the original problem. If not, the method produces an improved set of m variables and a corresponding canonical form. The procedure is iterated until an optimum solution is obtained. (Author).
Open All Close All
http://schema.org/about
- http://experiment.worldcat.org/entity/work/data/4216519#Topic/linear_programming
- http://experiment.worldcat.org/entity/work/data/4216519#Topic/scheduling
- http://experiment.worldcat.org/entity/work/data/4216519#Topic/algebra
- http://experiment.worldcat.org/entity/work/data/4216519#Topic/operations_research
- http://experiment.worldcat.org/entity/work/data/4216519#Topic/simultaneous_equations
- http://id.worldcat.org/fast/999090
- http://id.loc.gov/authorities/subjects/sh85077181
http://schema.org/description
- "The simplex method of solution of a linear program first transforms the original system to an equivalent system of m equations in canonical form by an elimination of m of the n unknowns. If the right choice of m variables is made, then by equating the remaining variables to zero, an optimal solution is obtained to the original problem. If not, the method produces an improved set of m variables and a corresponding canonical form. The procedure is iterated until an optimum solution is obtained. (Author)."@en