Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.tre.2005.07.005
Title: | A note on supply chain network equilibrium models | Authors: | Meng, Q. Huang, Y.K. Cheu, R.L. |
Keywords: | Network equilibrium Nonlinear complementarity problems Quasi-Newton algorithm Supply chain model Unconstrained minimization problems Variational inequalities |
Issue Date: | Jan-2007 | Citation: | Meng, Q., Huang, Y.K., Cheu, R.L. (2007-01). A note on supply chain network equilibrium models. Transportation Research Part E: Logistics and Transportation Review 43 (1) : 60-71. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2005.07.005 | Abstract: | This paper is concerned with the supply chain network equilibrium models proposed by Nagurney et al. [Nagurney, A., Dong, J., Zhang, D., 2002. A supply chain network equilibrium model. Transportation Research 38E, 281-303] and Dong et al. [Dong, J., Zhang, D., Nagurney, A., 2004. A supply chain network equilibrium model with random demands. European Journal of Operational Research 156, 194-212]. It demonstrates that these models possess the unconstrained continuously differentiable minimization formulations, whose any stationary point is the solution of the corresponding model. Accordingly, not only is the Quasi-Newton algorithm capable of finding a solution of the model, but also it can overcome the difficulty experienced by the modified projection method in choosing an appropriate predetermined step size. In addition, 11 benchmark examples are employed to show the advantage of the unconstrained minimization formulation. © 2005 Elsevier Ltd. All rights reserved. | Source Title: | Transportation Research Part E: Logistics and Transportation Review | URI: | http://scholarbank.nus.edu.sg/handle/10635/54574 | ISSN: | 13665545 | DOI: | 10.1016/j.tre.2005.07.005 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.