Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

DOI10.1007/s10107-004-0521-zzbMath1142.90429OpenAlexW2052204764MaRDI QIDQ2494508

Mathieu Van Vyve

Publication date: 28 June 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0521-z

zbMATH Keywords

Extended formulationLot-sizingBackloggingConstant capacity

Mathematics Subject Classification ID

Linear programming (90C05) Management decision making, including multiple objectives (90B50) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Single item lot-sizing with non-decreasing capacities, Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, On a class of mixed-integer sets with a single integer variable, The Mixing Set with Divisible Capacities, Single-item dynamic lot-sizing problems: an updated survey, LS-LIB: A Library of Tools for Solving Production Planning Problems, Lot sizing with minimum order quantity, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, Uncapacitated lot sizing with backlogging: the convex hull, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid, Approximate extended formulations

Cites Work

• Lot-size models with backlogging: Strong reformulations and cutting planes
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Mixing mixed-integer inequalities