The pivot and probe algorithm for solving a linear program

DOI10.1007/BF02592222zbMath0559.90052MaRDI QIDQ5184665

Awanti P. Sethi, Gerald L. Thompson

Publication date: 1984

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

zbMATH Keywords

simplex methodcomputational experiencecandidate constraintPivot and Probe Algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (10)

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

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

This page was built for publication: The pivot and probe algorithm for solving a linear program