Technical Note—Improved Bounds for Aggregated Linear Programs

DOI10.1287/OPRE.28.6.1450MaRDI QIDQ3893662zbMATH OpenOpenAlexFDO

Authors Roy Mendelssohn

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.6.1450

zbMATH Keywords

aggregation of linear programscomputational resultsimproved boundsZipkin's bounds

Mathematics Subject Classification ID

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

Cited in

(15)

• Strategic planning in forest industries
• A simulation study of some simplification strategies in the development of product-mix models
• Weights improvement in column aggregation
• A posteriori error bounds in linear programming aggregation
• Decomposition and iterative aggregation in hierarchical and decentralised planning structures
• An aggregate and iterative disaggregate algorithm with proven optimality in machine learning
• State partitioning based linear program for stochastic dynamic programs: an invariance property
• Iterative variable aggregation and disaggregation in IP: an application
• Aggregation bounds in stochastic linear programming
• A global convergence theorem for aggregation algorithms
• Optimization for L₁-Norm Error Fitting via Data Aggregation
• Modified iterative aggregation procedure for maintenance optimisation of multi-component systems with failure interaction
• Solving large-scale linear programs by aggregation
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
• Using error bounds to compare aggregated generalized transportation models

This page was built for publication: Technical Note—Improved Bounds for Aggregated Linear Programs

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