The value function of an infinite-horizon single-item lot-sizing problem

DOI10.1016/J.ORL.2011.10.014zbMATH Open1242.90138OpenAlexW2068270443MaRDI QIDQ433828FDOQ433828

Authors: Alejandro Toriello, G. L. Nemhauser 

Publication date: 6 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.10.014

Recommendations

• An algorithm for general infinite horizon lot sizing with deterministic demand
• The value-function of an infinite-horizon linear-quadratic problem
• Basic properties of the value functions of infinite-horizon optimal control problems
• Properties of the value function in optimal control problems with infinite horizon
• Suboptimality of equal lot sizes for finite-horizon problems

zbMATH Keywords

value functioninfinite optimizationmixed-integer programproduction lot-sizing

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Production Planning by Mixed Integer Programming
• Title not available (Why is that?)
• Shadow prices in infinite-dimensional linear programming
• Dynamic version of the economic lot size model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer and mixed-integer programming models: General properties
• Ending inventory valuation in multiperiod production scheduling
• Constructive characterizations of the value-function of a mixed-integer program. I

Cited In (1)

• Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems

This page was built for publication: The value function of an infinite-horizon single-item lot-sizing problem

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