Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems

DOI10.1007/s10287-007-0052-1zbMath1175.90026OpenAlexW1972337462MaRDI QIDQ1035283

Takaaki Egawa, Hiroshi Konno, Rei Yamamoto

Publication date: 2 November 2009

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-007-0052-1

zbMATH Keywords

dynamic programming algorithm0-1 integer programmingconcave cost inventory control problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum concave cost production system: A further generalization of multi-echelon model
• Approximating separable nonlinear functions via mixed zero-one programs
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
• Minimum Concave Cost Flows in Certain Networks
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• A Facilities in Series Inventory Model with Nested Schedules
• On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions