Experiments with external pivoting

DOI10.1016/0305-0548(90)90010-5zbMath0694.90070OpenAlexW2020286427MaRDI QIDQ909578

H. A. Eiselt, Carl-Louis Sandblom

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90010-5

zbMATH Keywords

external pivotingprimal simplex method

Mathematics Subject Classification ID

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

Related Items (3)

A computational study of redundancy in randomly generated polytopes ⋮ Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods ⋮ The complex interior-boundary method for linear and nonlinear programming with linear constraints

Uses Software

• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving large-scale linear programs by aggregation
• Redundancy in mathematical programming. A state-of-the-art survey
• A new polynomial-time algorithm for linear programming
• A feasible direction method for linear programming
• Computational behavior of a feasible direction method for linear programming
• On the average number of steps of the simplex method of linear programming
• Nonadjacent extreme point methods for solving linear programs
• The Efficiency of the Simplex Method: A Survey
• Bounds on the Effect of Aggregating Variables in Linear Programs
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Nonextreme point solution strategies for linear programs
• Solution of Large-Scale Transportation Problems Through Aggregation
• Pivot selection methods of the Devex LP code

This page was built for publication: Experiments with external pivoting