A pathological case in the reduction of linear programs

DOI10.1016/0167-6377(83)90036-6zbMath0506.90050OpenAlexW2060301750MaRDI QIDQ1837107

Yanyan Li

Publication date: 1983

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90036-6

zbMATH Keywords

simplex methodcomputational experiencefree variablespathological casereduction of linear programsspurious unbounded condition

Mathematics Subject Classification ID

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

Related Items (4)

Finding duplicate rows in a linear programming model ⋮ Presolving in linear programming ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Formal optimization of some reduced linear programming problems

Cites Work

• Extreme points of Leontief substitution systems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Reinversion with the preassigned pivot procedure
• Unnamed Item
• Unnamed Item

This page was built for publication: A pathological case in the reduction of linear programs