Abstract
We present a branch and bound algorithm for finding the optimal ordering policy for a multiproduct inventory system with deterministic demand, infinite horizon, and no backlogging. Ordering costs are assumed to include a separate set-up cost for each product ordered, but with a fixed savings each time all products are simultaneously ordered. Holding costs accrue at a constant rate per unit of each product. We first restrict our search to policies of a certain type, and then prove several theorems which lead to an efficient algorithm. For the two-product case, a special algorithm is developed to give more precise results than earlier authors.
Sign-in/Register to access full text options 
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.
