Article ID: | iaor20133596 |
Volume: | 144 |
Issue: | 1 |
Start Page Number: | 397 |
End Page Number: | 404 |
Publication Date: | Jul 2013 |
Journal: | International Journal of Production Economics |
Authors: | Chern Maw-Sheng, Teng Jinn-Tsair, Chan Ya-Lan, Pan Qinhua, Chen Sheng-Chih |
Keywords: | simulation, combinatorial optimization, programming: dynamic, game theory |
In practice, vendors (or sellers) often offer their buyers a fixed credit period to settle the account. The benefits of trade credit are not only to attract new buyers but also to avoid lasting price competition. On the other hand, the policy of granting a permissible delay adds not only an additional cost but also an additional dimension of default risk to vendors. In this paper, we will incorporate the fact that granting a permissible delay has a positive impact on demand but negative impacts on both costs and default risks to establish vendor–buyer supply chain models. Then we will derive the necessary and sufficient conditions to obtain the optimal solution for both the vendor and the buyer under non‐cooperative Stackelberg equilibrium. Finally, we will use two numerical examples to show that (1) granting a permissible delay may significantly improve profits for both the vendor and the buyer, (2) the sensitivity analysis on the optimal solution with respect to each parameter, and (3) the comparisons between Nash and Stackelberg solutions.