New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem

DOI10.1007/s10107-022-01847-yzbMath1518.90054OpenAlexW4283257046MaRDI QIDQ6038656

Chuanhou Gao, Zeyang Zhang, James R. Luedtke

Publication date: 2 May 2023

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

Full work available at URL: https://doi.org/10.1007/s10107-022-01847-y

zbMATH Keywords

finite set of scenariosrandom future demandsWagner-Whitin condition

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Production models (90B30)

Cites Work

• On the mixing set with a knapsack constraint
• An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
• An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
• An integer programming approach for linear programs with probabilistic constraints
• On stochastic lot-sizing problems with random lead times
• Uncapacitated lot sizing with backlogging: the convex hull
• Lot-size models with backlogging: Strong reformulations and cutting planes
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
• A polyhedral study on chance constrained program with random right-hand side
• A polyhedral study of the static probabilistic lot-sizing problem
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A study of the lot-sizing polytope
• On mixing sets arising in chance-constrained programming
• Approximate extended formulations
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Dynamic Version of the Economic Lot Size Model
• Uncapacitated lot-sizing: The convex hull of solutions
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• A branch and bound method for stochastic integer problems under probabilistic constraints
• Production Planning by Mixed Integer Programming
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• The mixed vertex packing problem.
• Mixing mixed-integer inequalities

This page was built for publication: New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem