Abstract
Abstract The determination of replenishment quantities for multiple products with dynamic demand, subject to storage constraints, is addressed. A lower bound is obtained by solving the dual problem. Both subgradient optimization of the Lagrangean relaxation and LP relaxation of the convexified solution space are considered. Dantzig-Wolfe decomposition is used to solve the LP relaxation. A heuristic is proposed for the generation of feasible solutions obtained by modifying solutions created at each step of either subgradient optimization or Dantzig-Wolfe decomposition. An experimental investigation of 428 test problems indicates that the heuristic coupled with sub-gradient optimization gives consistently good solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
