Article ID: | iaor1996494 |
Country: | United States |
Volume: | 29 |
Issue: | 5 |
Start Page Number: | 65 |
End Page Number: | 80 |
Publication Date: | Mar 1995 |
Journal: | Computers & Mathematics with Applications |
Authors: | Bai S.X., Tsai Y.-K. |
Keywords: | production, game theory |
In this paper, the authors study a production control problem in a competitive environment. Two firms produce the same product and compete against each other. The demand is random and so is the production capacity. Each firm needs to decide how much it will produce daily without knowing what the competitor is doing. If it produces too much, the firm has to pay an inventory cost. If it produces too little, unsatisfied customers are turned away to its competitor. The daily demand is randomly allocated between the two firms. The authors consider a finite planning horizon. The control problem is formulated as a finite dynamic game. Algorithms are developed to determine the control policies of interest. Numerical examples are presented. Comparisons are made with the control policies from a single-firm optimization model.