Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3893
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.creator | Bertsimas, Dimitris J. | - |
dc.creator | Thiele, Aurélie | - |
dc.date | 2003-12-14T23:09:33Z | - |
dc.date | 2003-12-14T23:09:33Z | - |
dc.date | 2004-01 | - |
dc.date.accessioned | 2013-10-09T02:33:00Z | - |
dc.date.available | 2013-10-09T02:33:00Z | - |
dc.date.issued | 2013-10-09 | - |
dc.identifier | http://hdl.handle.net/1721.1/3893 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
dc.description | We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. The attractive features of the proposed approach are: (a) It incorporates a wide variety of phenomena, including demands that are not identically distributed over time and capacity on the echelons and links; (b) it uses very little information on the demand distributions; (c) it leads to qualititatively similar optimal policies (basestock policies) as in dynamic programming; (d) it is numerically tractable for large scale supply chain problems even in networks, where dynamic programming methods face serious dimensionality problems; (e) in preliminary computation experiments, it often outperforms dynamic programming based solutions for a wide range of parameters. | - |
dc.description | Singapore-MIT Alliance (SMA) | - |
dc.format | 413796 bytes | - |
dc.format | application/pdf | - |
dc.language | en_US | - |
dc.relation | High Performance Computation for Engineered Systems (HPCES); | - |
dc.subject | robust optimization approach | - |
dc.subject | supply chain management | - |
dc.subject | stochastic demand | - |
dc.subject | discrete time | - |
dc.title | A Robust Optimization Approach to Supply Chain Management | - |
dc.type | Article | - |
Appears in Collections: | MIT Items |
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.