An extended algorithm for capacitated multiple item ordering with quantity discounts

MaRDI QIDQ1370558zbMATH OpenFDO

Authors Faruk Güder, James L. Zydiak, Sohail S. Chaudhry

Publication date 1 February 1998

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmLagrangian relaxationorder quantities for multiple items

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• Capacitated Multiple Item Ordering with Incremental Quantity Discounts
• Determining order quantities in multi-product inventory systems subject to multiple constraints and incremental discounts
• A practical model for ordering in multi-product multi-constraint inventory systems with all-units quantity discounts
• On computing optimal (Q,r) replenishment policies under quantity discounts
• scientific article; zbMATH DE number 151907

Cited in

(7)

• Non-stationary ordering policies for multi-item inventory systems subject to a single resource constraint and quantity discounts
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• An exact algorithm for the capacitated total quantity discount problem
• Shared resource capacity expansion decisions for multiple products with quantity discounts
• An effective matheuristic for the capacitated total quantity discount problem
• A practical model for ordering in multi-product multi-constraint inventory systems with all-units quantity discounts
• Capacitated Multiple Item Ordering with Incremental Quantity Discounts

This page was built for publication: An extended algorithm for capacitated multiple item ordering with quantity discounts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370558)