Technical Note—Improved Bounds for Aggregated Linear Programs

DOI10.1287/opre.28.6.1450zbMath0447.90054OpenAlexW2153686651MaRDI QIDQ3893662

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

computational resultsimproved boundsaggregation of linear programsZipkin's bounds

Mathematics Subject Classification ID

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

Related Items (15)

Weights improvement in column aggregation ⋮ Iterative variable aggregation and disaggregation in IP: an application ⋮ A posteriori error bounds in linear programming aggregation ⋮ Using error bounds to compare aggregated generalized transportation models ⋮ 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 ⋮ A simulation study of some simplification strategies in the development of product-mix models ⋮ A global convergence theorem for aggregation algorithms ⋮ Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach ⋮ Solving large-scale linear programs by aggregation ⋮ Optimization for L₁-Norm Error Fitting via Data Aggregation ⋮ Modified iterative aggregation procedure for maintenance optimisation of multi-component systems with failure interaction ⋮ Aggregation bounds in stochastic linear programming ⋮ Strategic planning in forest industries

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