An efficient optimal algorithm for the quantity discount problem in material requirement planning

DOI10.1016/j.cor.2008.05.003zbMath1179.90015OpenAlexW1969742752MaRDI QIDQ1000957

Fereydoon Kianfar, Shahram Shadrokh, S. Hamid Mirmohammadi

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.05.003

zbMATH Keywords

inventorybranch and boundpurchasinglot sizingall-units discount

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05)

Related Items (7)

New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty ⋮ Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount ⋮ An exact algorithm for the capacitated total quantity discount problem ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale

Cites Work

• Exact algorithms for procurement problems under a total quantity discount structure
• A classification of literature on determining the lot size under quantity discounts
• Dynamic Version of the Economic Lot Size Model

This page was built for publication: An efficient optimal algorithm for the quantity discount problem in material requirement planning