Bounds on the Effect of Aggregating Variables in Linear Programs

DOI10.1287/OPRE.28.2.403MaRDI QIDQ3863690zbMATH OpenOpenAlexFDO

Authors Paul Zipkin

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

accuracy analysislarge linear programsvariables aggregation

Mathematics Subject Classification ID

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

Cited in

(34)

• Lower and upper bounds for linear production games
• Strategic planning in forest industries
• A simulation study of some simplification strategies in the development of product-mix models
• A procedure for optimizing tactical response in oil spill clean up operations
• Improving aggregation bounds for two-stage stochastic programs
• Aggregation and decomposition for multi-divisional linear programs
• Weights improvement in column aggregation
• A posteriori error bounds in linear programming aggregation
• Duality and statistical tests of optimality for two stage stochastic programs
• Decomposition and iterative aggregation in hierarchical and decentralised planning structures
• Distributed decision making----a unified approach.
• On multilevel iterative methods for optimization problems
• Heuristic methods and applications: A categorized survey
• A hierarchy of bounds for stochastic mixed-integer programs
• Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
• Single-period stochastic demand fulfillment in customer hierarchies
• Optimal weights and degeneracy in variable aggregated linear programs
• Iterative variable aggregation and disaggregation in IP: an application
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
• A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
• Sequential bounding methods for two-stage stochastic programs
• Error bounds for the aggregated convex programming problem
• An ideal column algorithm for integer programs with special ordered sets of variables
• Aggregation bounds in stochastic linear programming
• A global convergence theorem for aggregation algorithms
• Column aggregation and primal decomposition in linear programming: some observations
• Modified iterative aggregation procedure for maintenance optimisation of multi-component systems with failure interaction
• An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
• Solving large-scale linear programs by aggregation
• On the safe side of stochastic programming: bounds and approximations
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
• Restrictive aggregation of items in multi-stage production systems
• Using error bounds to compare aggregated generalized transportation models
• Experiments with external pivoting

This page was built for publication: Bounds on the Effect of Aggregating Variables in Linear Programs

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