Supply chain network design under profit maximization and oligopolistic competition
In this paper, we model the supply chain network design problem with oligopolistic firms who are involved in the competitive production, storage, and distribution of a homogeneous product to multiple demand markets. The profit-maximizing firms select both the capacities associated with the various supply chain network activities as well as the product quantities. We formulate the governing Nash-Cournot equilibrium conditions as a variational inequality problem and identify several special cases of the model, notably, a generalization of a spatial oligopoly and a classical oligopoly problem to include design capacity variables. The proposed computational approach, which is based on projected dynamical systems, fully exploits the network structure of the problems and yields closed form solutions at each iteration. In order to illustrate the modeling framework and the algorithm, we also provide solutions to a spectrum of numerical supply chain network oligopoly design examples. This paper makes a contribution to game theoretic modeling of competitive supply chain network design problems in an oligopolistic setting.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 46 (2010)
Issue (Month): 3 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:3:p:281-294. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.