On Estimating Optimal Bases for Linear Programs

DOI10.1080/02522667.1986.10698835MaRDI QIDQ3731365zbMATH OpenOpenAlexFDO

Authors H. A. Eiselt, Carl-Louis Sandblom

Publication date 1986

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1986.10698835

zbMATH Keywords

empirical studyexternal pivotingestimating the optimal basis

Mathematics Subject Classification ID

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

Recommendations

• Empirical column selection method in the simplex method
• Experiments with external pivoting
• On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
• An optimal-basis identification technique for interior-point linear programming algorithms
• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem

Cites work

• scientific article; zbMATH DE number 3197060 (Why is no real title available?)
• Khachiyan's linear programming algorithm
• Khachiyan’s algorithm for linear programming
• On the average number of steps of the simplex method of linear programming
• Pivot selection methods of the Devex LP code
• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method

Cited in

(2)

• An efficient basis update for asymptotic linear programming
• Experiments with external pivoting

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: On Estimating Optimal Bases for Linear Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731365)