Abstract

In this paper, we address a multi-period multi-product acquisition planning problem where the retailer faces uncertain demand for the products and the suppliers provide all-unit quantity discounts. The problem is an extension of single period constrained newsvendor problem, which considers both the supplier discounts and multiple periods. We formulate the problem as a mixed integer nonlinear programming model and develop a Lagrangian relaxation based approach. Efficient solution procedures are presented to solve the decomposed sub-problems that are based on the properties of the problem. Computational results show that the Lagrangian method can quickly obtain very good solutions.

Full Text
Paper version not known

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 call

Disclaimer: 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.