Optimal replenishment order placement in a finite time horizon

DOI10.1007/s10957-013-0452-zzbMath1320.90081OpenAlexW2097471115MaRDI QIDQ2342144

Manlio Gaudioso, Giovanna Miglionico, Giovanni Giallombardo

Publication date: 11 May 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0452-z

zbMATH Keywords

inventory managementcoordinate search methodsnonsmooth~analysisreplenishment problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• DC models for spherical separation
• A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Margin maximization in spherical separation
• Piecewise linear approximations in nonconvex nonsmooth optimization
• A review of the joint replenishment problem literature: 1989--2005
• Optimization and nonsmooth analysis
• A Simple Method of Determining Order Quantities in Joint Replenishments Under Deterministic Demand
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• An Incremental Method for Solving Convex Finite Min-Max Problems
• Convex analysis and global optimization
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: Optimal replenishment order placement in a finite time horizon