Formal optimization of some reduced linear programming problems

DOI10.1007/BF02591947zbMATH Open0535.90059OpenAlexW2009073392MaRDI QIDQ3320119FDOQ3320119

Authors:

Publication date: 1983

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

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

Recommendations

• Presolving in linear programming
• scientific article; zbMATH DE number 679862
• scientific article; zbMATH DE number 1866915
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• scientific article; zbMATH DE number 1131726

zbMATH Keywords

model reductioncomputational resultssimplex methodoptimum solutionpost-solution proceduresparsity, degeneracy

Mathematics Subject Classification ID

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

Cites Work

• Evolution of linear programming computing techniques
• 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
• Title not available (Why is that?)
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• On pricing and backward transformation in linear programming
• A pathological case in the reduction of linear programs
• Title not available (Why is that?)

Cited In (17)

• Formal Proofs for Nonlinear Optimization
• Presolving in linear programming
• Finding duplicate rows in a linear programming model
• Solving large-scale mixed-integer programs with fixed charge variables
• Consistency, redundancy, and implied equalities in linear systems
• On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints
• Title not available (Why is that?)
• Selected bibliography on degeneracy
• Linear transformations to decrease computational requirements of solving some known linear programming models
• Addendum to ``Presolve analysis of linear programs prior to applying an interior point method
• Title not available (Why is that?)
• Domain reduction techniques for global NLP and MINLP optimization
• Verified reductions for optimization
• Title not available (Why is that?)
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Strict Linear Programs and Tight Matrices
• A note on solving MINLP's using formulation space search

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

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