Difference: LinearProgramming (4 vs. 5)
Revision 52008-02-21 - MichaelOSullivan
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
| ||||||||
| Line: 30 to 30 | ||||||||
The process of solving a linear programme is called linear programming. Linear programming is done via the Revised Simplex Method (also known as the Primal Simplex Method), the Dual Simplex Method or an interior point method. Some software packages, such as CPLEX, allow you to specify which method you use, but we won't go into further detail here. | ||||||||
| Changed: | ||||||||
| < < | Integer Programming Topics | |||||||
| > > | Linear Programming Topics | |||||||
| To see linear programming in action, check out some of the linear programming case studies: | ||||||||
View topic | History: r9 < r8 < r7 < r6 | More topic actions...
Copyright © 2008-2026 by the contributing authors. All material on this collaboration platform is the property of the contributing authors. Ideas, requests, problems regarding TWiki? Send feedback