scientific article; zbMATH DE number 3880435

MaRDI QIDQ3346085zbMATH OpenFDO

Authors Gerhard Knolmayer

Publication date 1984

zbMATH Keywords

column aggregated linear programcomputation of boundsFourier-Motzkin eliminationoptimal dual solutionsurrogate constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• scientific article; zbMATH DE number 4087417
• A posteriori error bounds in linear programming aggregation
• Dual network bounds for integer programming problems of a special form
• scientific article; zbMATH DE number 3980917
• scientific article; zbMATH DE number 1069803

Cited in

(3)

• The transformation technique for a class of variable upper bounding constraints in linear programming
• On some properties of \(0\)-degeneracy graphs
• Linear transformations to decrease computational requirements of solving some known linear programming models

This page was built for publication:

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