The pivot and probe algorithm for solving a linear program

DOI10.1007/BF02592222zbMath0559.90052MaRDI QIDQ5184665

Gerald L. Thompson, Awanti P. Sethi

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

simplex method; computational experience; candidate constraint; Pivot and Probe Algorithm

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C05: Linear programming

Related Items

A survey of dynamic network flows, A constraint selection technique for a class of linear programs, Probing through the intersection of hyperplanes, Pivot rules for linear programming: A survey on recent theoretical developments, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Branch-and-cut solution of inference problems in propositional logic, Solution of constrained generalized transportation problems using the pivot and probe algorithm, A constraint selection technique in limit analysis, Computational results with a primal-dual subproblem simplex method, A computationally stable solution algorithm for linear programs

Cites Work

• Unnamed Item
• Solution of constrained generalized transportation problems using the pivot and probe algorithm
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• New Finite Pivoting Rules for the Simplex Method
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Proximate linear programming: A variable extreme point method
• Optimality and Degeneracy in Linear Programming