An analysis of an available set of linear programming test problems

DOI10.1016/0305-0548(89)90018-XzbMath0661.90056OpenAlexW2068401465MaRDI QIDQ1113798

Irvin J. Lustig

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90018-x

zbMATH Keywords

simplex methodtest problemsMINOS

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

A clustering heuristic to detect staircase structures in large scale linear programming models ⋮ An analysis of an available set of linear programming test problems ⋮ Gigaflops in linear programming ⋮ Modified fictitious play for solving matrix games and linear-programming problems ⋮ George B. Dantzig and systems optimization ⋮ A barrier method for dynamic Leontief-type linear programs ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Steepest-edge simplex algorithms for linear programming ⋮ A practical anti-cycling procedure for linearly constrained optimization ⋮ On the use of dense matrix techniques within sparse simplex ⋮ Feasibility issues in a primal-dual interior-point method for linear programming

Uses Software

• MINOS

Cites Work

• A new polynomial-time algorithm for linear programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• An analysis of an available set of linear programming test problems
• Solving staircase linear programs by the simplex method, 1: Inversion
• Unnamed Item