Bounds for Row-Aggregation in Linear Programming

DOI10.1287/OPRE.28.4.903MaRDI QIDQ3883889zbMATH 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.4.903

zbMATH Keywords

aggregationbounds for row-aggregationmeasures of accuracy loss

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Cited in

(25)

• Lower and upper bounds for linear production games
• Strategic planning in forest industries
• The multicommodity assignment problem: A network aggregation heuristic
• A simulation study of some simplification strategies in the development of product-mix models
• A stochastic dynamic programming model for scheduling of offshore petroleum fields with resource uncertainty
• A procedure for optimizing tactical response in oil spill clean up operations
• Improving aggregation bounds for two-stage stochastic programs
• A posteriori error bounds in linear programming aggregation
• Duality and statistical tests of optimality for two stage stochastic programs
• On multilevel iterative methods for optimization problems
• A hierarchy of bounds for stochastic mixed-integer programs
• Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
• Multistage stochastic convex programs: duality and its implications
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
• Clustering-based preconditioning for stochastic programs
• 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
• Aggregation bounds in stochastic linear programming
• 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
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Restrictive aggregation of items in multi-stage production systems
• An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure

This page was built for publication: Bounds for Row-Aggregation in Linear Programming

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