Linear Programming

Network Simplex Pivot Tool

Advanced Pivot Tool

Simple Pivot Tool

Simplex Method Tools

Developed by George Dantzig in 1947, the simplex method is a general procedure for solving linear programming (LP) problems. The simplex method is an algebraic procedure based on solving systems of equations; it has proved to be very efficient in practice as an algorithm for solving large-scale LPs, even though its worst-case complexity is exponential. Below are links to JavaScript-based simplex pivot tools developed by Robert Vanderbei at Princeton University.

Linear Programming References

This collection of textbook references for linear programming is an updated version of the list created by Bob Fourer in the Linear Programming FAQ.

Back to Linear Programming

The choice of an appropriate textbook for an undergraduate or graduate course depends on the topics that will be emphasized: brief overview of algorithms, deeper study of algorithms, theorems and proofs, complexity theory, efficient linear algebra, modeling techniques, solution analysis, and so on.

Pages

Subscribe to RSS - Linear Programming