Formal optimization of some reduced linear programming problems

DOI10.1007/BF02591947zbMath0535.90059OpenAlexW2009073392MaRDI QIDQ3320119

No author found.

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1007/bf02591947

zbMATH Keywords

model reductionsimplex methodcomputational resultsoptimum solutionpost-solution proceduresparsity, degeneracy

Mathematics Subject Classification ID

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

Related Items (8)

Finding duplicate rows in a linear programming model ⋮ Presolving in linear programming ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints ⋮ On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method ⋮ Solving large-scale mixed-integer programs with fixed charge variables ⋮ Selected bibliography on degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• A pathological case in the reduction of linear programs
• Evolution of Linear Programming Computing Techniques
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• 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
• On pricing and backward transformation in linear programming

This page was built for publication: Formal optimization of some reduced linear programming problems