File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/07408170590961120
- Scopus: eid_2-s2.0-22944440358
- WOS: WOS:000231702300006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A multi-commodity supply chain design problem
Title | A multi-commodity supply chain design problem |
---|---|
Authors | |
Issue Date | 2005 |
Citation | IIE Transactions (Institute of Industrial Engineers), 2005, v. 37, n. 8, p. 753-762 How to Cite? |
Abstract | We consider a multi-commodity supply chain design problem in which we need to determine where to locate facilities and how to allocate customers to facilities so as to minimize total costs. The cost associated with each facility exhibits economies of scale. We show that this problem can be formulated as a nonlinear integer program and propose a Lagrangian-relaxation solution algorithm. By exploiting the structure of the problem, we find a low-order polynomial algorithm for the nonlinear integer program that must be solved in solving the Lagrangian relaxation subproblems. We also compare our approach with an existing algorithm. Copyright © "IIE". |
Persistent Identifier | http://hdl.handle.net/10722/296028 |
ISSN | 2018 Impact Factor: 2.884 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shen, Zuo Jun Max | - |
dc.date.accessioned | 2021-02-11T04:52:41Z | - |
dc.date.available | 2021-02-11T04:52:41Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | IIE Transactions (Institute of Industrial Engineers), 2005, v. 37, n. 8, p. 753-762 | - |
dc.identifier.issn | 0740-817X | - |
dc.identifier.uri | http://hdl.handle.net/10722/296028 | - |
dc.description.abstract | We consider a multi-commodity supply chain design problem in which we need to determine where to locate facilities and how to allocate customers to facilities so as to minimize total costs. The cost associated with each facility exhibits economies of scale. We show that this problem can be formulated as a nonlinear integer program and propose a Lagrangian-relaxation solution algorithm. By exploiting the structure of the problem, we find a low-order polynomial algorithm for the nonlinear integer program that must be solved in solving the Lagrangian relaxation subproblems. We also compare our approach with an existing algorithm. Copyright © "IIE". | - |
dc.language | eng | - |
dc.relation.ispartof | IIE Transactions (Institute of Industrial Engineers) | - |
dc.title | A multi-commodity supply chain design problem | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/07408170590961120 | - |
dc.identifier.scopus | eid_2-s2.0-22944440358 | - |
dc.identifier.volume | 37 | - |
dc.identifier.issue | 8 | - |
dc.identifier.spage | 753 | - |
dc.identifier.epage | 762 | - |
dc.identifier.isi | WOS:000231702300006 | - |
dc.identifier.issnl | 0740-817X | - |