Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

EOR

2007

2007

In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This policy implies that every supplier announces a number of volume intervals and that the volume interval in which the total amount ordered lies determines the discount. Moreover, the discounted prices apply to all goods bought from the supplier, not only to those goods exceeding the volume threshold. We refer to this cost-minimization problem as the total quantity discount (TQD) problem. We give a mathematical formulation for this problem and argue that not only it is NP-hard, but also that there exists no polynomial-time approximation algorithm with a constant ratio (unless P = NP). Apart from the basic form of the TQD problem, we describe four variants. In a ﬁrst variant, the market share that one or more suppliers can obtain is constrained. Another variant allows the buyer to procure more goods than strict...

Added |
13 Dec 2010 |

Updated |
13 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
EOR |

Authors |
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spieksma, Joris van de Klundert |

Comments (0)