Article ID: | iaor2005847 |
Country: | United States |
Volume: | 13 |
Issue: | 1 |
Start Page Number: | 34 |
End Page Number: | 45 |
Publication Date: | Mar 2001 |
Journal: | Production and Operations Management |
Authors: | Chen M., Souza G.C., Zhao Z., Ball M.O. |
Keywords: | programming: mathematical |
In this paper, the supplier of a key component to a global manufacturer offers a one-time price discount; we study the firm's optimal response to the discount under two different strategies. In the first strategy, the firm does not pass along the discount to its customers (sales subsidiaries); the firm simply coordinates purchasing and production among the different factories to take advantage of this one-time price discount. In the second strategy, the firm offers price discounts for its most profitable products in different sales subsidiaries to increase their demand. We carried out experiments for the two strategies based on a mathematical programming model, built around Toshiba's global notebook supply chain. Model constraints include, among others, material constraints, bills-of-materials, capacity and transportation constraints, minimum lot size constraints, and a constraint on minimum fill rate (service level constraint). Unlike most models of this type in the literature, which define variables in terms of single arc flows, we employ path variables, which allow for direct identification and manipulation of profitable and non-profitable products.