Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2010. / Cataloged from PDF version of thesis. / Includes bibliographical references (p. 63-64). / This thesis aims to solve the periodic-reviewed inventory control problem in supply chain networks with uncertain demand so as to minimize the overall cost of the system over a fixed planning time horizon. In such problems, one seeks to optimally determine ordering quantities at different stages in time. We investigate the class of polynomial policies, where the control policy is directly parametrized polynomially in the observed uncertainties of previous stages. We use sum-of-square relaxations to reformulate the problem into a single semidefinite optimization problem for a specific polynomial degree. We consider both robust and stochastic approaches in order to address the uncertainties in demand. In extensive numerical studies, we find that polynomial policies exhibit better performance over basestock policies across a variety of networks and demand distributions under the mean and standard deviation criteria. However, when the uncertainty set turns out to be larger than planned, basestock policies start outperforming polynomial policies. Comparing the policies obtained under the robust and stochastic frameworks, we find that they are comparable in the average performance criterion, but the robust approach leads to better tail behavior and lower standard deviation in general. / by Liwei He. / S.M.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/61893 |
| Date | January 2010 |
| Creators | He, Liwei |
| Contributors | Dimitris Bertsimas., Massachusetts Institute of Technology. Computation for Design and Optimization Program., Massachusetts Institute of Technology. Computation for Design and Optimization Program. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 64 p., application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.025 seconds