# Linear Programming

# Hints on Using the Advanced Simplex Pivot Tool

Back to Advanced Pivot Tool

#### Introduction

The advanced pivot tool can serve as an aid for several variants of the simplex method. In particular, it can be used for all of the variants of the simplex method described in Linear Programming: Foundations and Extensions (LP:F&E) by Robert Vanderbei. A few pointers are given below.

# 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 FAQ

**The Linear Programming FAQ is no longer maintained. For links to the relevant content in the NEOS Optimization Guide, see the revised LP FAQ.**

# Linear Programming FAQ

The Linear Programming FAQ, established by John W. Gregory and maintained for many years by Robert Fourer, was last updated in 2005. Since the LP FAQ is no longer maintained, the content has been incorporated into the relevant sections of the NEOS Optimization Guide. Please follow the links below.

# 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.