TY - JOUR

T1 - Supply chain network equilibrium problem with capacity constraints

AU - Chen, Huey Kuo

AU - Chou, Huey Wen

PY - 2008

Y1 - 2008

N2 - The supply chain network equilibrium problem with capacity constraints (SCNE-C) is an extension of the supply chain network equilibrium problem (SCNE), which also takes into account capacity constraints which refer to the maximum production capacity for a manufacturer or the maximum storage/display space for a retailer. Due to inherent link interactions in the demand functions and cost functions, the SCNE-C problem is formulated as a mathematical model using the variational inequality (VI) approach. This VI model is characterised by the so-called Wardrop second principle (in terms of the 'generalised' route cost). To solve the model, a path-based four-loop nested diagonalisation method, along with a supernetwork representation, is proposed and demonstrated with a few numerical examples. The obtained results fully comply with the Wardrop second principle at both retailer sector and demand markets and can provide useful route information of the product. In addition, the stricter the capacity constraints imposed, the lower the quantity demanded will be, and provided at a higher product price. The concepts developed in this paper can be extended into many other spatial price equilibrium problems.

AB - The supply chain network equilibrium problem with capacity constraints (SCNE-C) is an extension of the supply chain network equilibrium problem (SCNE), which also takes into account capacity constraints which refer to the maximum production capacity for a manufacturer or the maximum storage/display space for a retailer. Due to inherent link interactions in the demand functions and cost functions, the SCNE-C problem is formulated as a mathematical model using the variational inequality (VI) approach. This VI model is characterised by the so-called Wardrop second principle (in terms of the 'generalised' route cost). To solve the model, a path-based four-loop nested diagonalisation method, along with a supernetwork representation, is proposed and demonstrated with a few numerical examples. The obtained results fully comply with the Wardrop second principle at both retailer sector and demand markets and can provide useful route information of the product. In addition, the stricter the capacity constraints imposed, the lower the quantity demanded will be, and provided at a higher product price. The concepts developed in this paper can be extended into many other spatial price equilibrium problems.

KW - Capacity constraint

KW - Gradient projection algorithm

KW - Supply chain network equilibrium

KW - Variational inequality approach

UR - http://www.scopus.com/inward/record.url?scp=57749197405&partnerID=8YFLogxK

U2 - 10.1111/j.1435-5957.2008.00174.x

DO - 10.1111/j.1435-5957.2008.00174.x

M3 - 期刊論文

AN - SCOPUS:57749197405

SN - 1056-8190

VL - 87

SP - 605

EP - 621

JO - Papers in Regional Science

JF - Papers in Regional Science

IS - 4

ER -