A posteriori error bounds in linear programming aggregation

DOI10.1016/S0305-0548(96)00034-2zbMath0884.90113OpenAlexW4230149185MaRDI QIDQ1361389

Rainer Leisten

Publication date: 23 July 1997

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00034-2

zbMATH Keywords

aggregation of linear programming problemsestimation of the aggregation error

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items

Using error bounds to compare aggregated generalized transportation models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving large-scale linear programs by aggregation
• Bounds on the suboptimalization of aggregation in convex programming
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems
• Bounds for Row-Aggregation in Linear Programming
• Technical Note—Improved Bounds for Aggregated Linear Programs
• Computing bounds for the optimal value in linear programming
• Gradient schemes in iterative aggregation procedures for variable-aggregated lp-problems