Show simple item record

dc.contributor.advisorDimitris J. Bertsimas.en_US
dc.contributor.authorThiele, Aurélie, 1977-en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2005-05-17T14:57:25Z
dc.date.available2005-05-17T14:57:25Z
dc.date.copyright2004en_US
dc.date.issued2004en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/16693
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.en_US
dc.descriptionIncludes bibliographical references (p. 171-176).en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.description.abstractThe contribution of this thesis is to provide a tractable framework for supply chains and revenue management problems subject to uncertainty that gives insight into the structure of the optimal policy and requires little knowledge of the underlying probability distributions. Instead, we build upon recent advances in the field of robust optimization to develop models of uncertainty that make few probabilistic assumptions and have an adjustable level of conservatism to ensure performance. Specifically, we consider two classes of robust optimization approaches. First, we model the random variables as uncertain parameters belonging to a polyhedral uncertainty set, and optimize the system against the worst-case value of the uncertainty in the set. The polyhedron is affected by budgets of uncertainty, which reflect a trade-off between robustness and optimality. We apply this framework to supply chain management, show that the robust problem is equivalent to a deterministic problem with modified parameters, and derive the main properties of the optimal policy. We also explore a second approach, which builds directly on the historical realizations of uncertainty, without requiring any estimation. In that model, a fraction of the best cases are removed to ensure robustness, and the system is optimized over the sample average of the remaining data. This leads to tractable mathematical programming problems. We apply this framework to revenue management problems, and show that in many cases, the optimal policy simply involves an appropriate ranking of the historical data. Robust optimization emerges as a promising methodology to address a wide range of management problems subject to uncertainty, in particular in a dynamic setting, as it leads toen_US
dc.description.abstract(cont.) representations of randomness that make few assumptions on the underlying probabilities, remain numerically tractable, incorporate the decision-maker's risk aversion, and provides theoretical insights into the structure of the optimal policy.en_US
dc.description.statementofresponsibilityby Aurélie Thiele.en_US
dc.format.extent176 p.en_US
dc.format.extent1243465 bytes
dc.format.extent1164984 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleA robust optimization approach to supply chains and revenue managementen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc57368700en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record