Lot-sizing with fixed charges on stocks: the convex hull

DOI10.1016/J.DISOPT.2004.07.001MaRDI QIDQ2386201zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 August 2005

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2004.07.001

zbMATH Keywords

Lot-sizingStockFixed chargePolyhedral analysis

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Recommendations

• A note on ``Lot-sizing with fixed charges on stocks: the convex hull
• Uncapacitated lot-sizing: The convex hull of solutions
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Lot-sizing with stock upper bounds and fixed charges
• Erratum: Lot-sizing with stock upper bounds and fixed charges
• The multiscenario lot size problem with concave costs.
• Uncapacitated lot sizing with backlogging: the convex hull
• The stochastic lot sizing problem with piecewise linear concave ordering costs
• A polynomial time algorithm for convex cost lot-sizing problems
• A study of the lot-sizing polytope

Cites work

• scientific article; zbMATH DE number 3568353 (Why is no real title available?)
• scientific article; zbMATH DE number 780785 (Why is no real title available?)
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Dynamic version of the economic lot size model
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Improved Algorithms for Economic Lot Size Problems
• Network flows. Theory, algorithms, and applications.
• Packing and covering a tree by subtrees
• Polyhedra for lot-sizing with Wagner-Whitin costs
• The Deterministic Dynamic Product Cycling Problem
• The uncapacitated lot-sizing problem with sales and safety stocks
• Uncapacitated lot-sizing: The convex hull of solutions

Cited in

(15)

• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
• The uncapacitated lot-sizing problem with sales and safety stocks
• A note on ``Lot-sizing with fixed charges on stocks: the convex hull
• Uncapacitated lot-sizing: The convex hull of solutions
• Convex hull results for the warehouse problem
• Uncapacitated lot sizing with backlogging: the convex hull
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Single-item dynamic lot-sizing problems: an updated survey
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
• Modeling industrial lot sizing problems: a review
• Lot-sizing with stock upper bounds and fixed charges
• Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
• Uncapacitated Lot-Sizing Problems with Start-Up Costs

This page was built for publication: Lot-sizing with fixed charges on stocks: the convex hull

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