Stochastic analysis via robust optimization
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2016.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/103246 |
| _version_ | 1826192533869297664 |
|---|---|
| author | Youssef, Nataly |
| author2 | Dimitris Bertsimas. |
| author_facet | Dimitris Bertsimas. Youssef, Nataly |
| author_sort | Youssef, Nataly |
| collection | MIT |
| description | Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2016. |
| first_indexed | 2024-09-23T09:18:00Z |
| format | Thesis |
| id | mit-1721.1/103246 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:18:00Z |
| publishDate | 2016 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1032462019-04-12T23:37:18Z Stochastic analysis via robust optimization Youssef, Nataly Dimitris Bertsimas. Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Operations Research Center. Operations Research Center. Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2016. Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 167-174). To evaluate the performance and optimize systems under uncertainty, two main avenues have been suggested in the literature: stochastic analysis and optimization describing the uncertainty probabilistically and robust optimization describing the uncertainty deterministically. Instead, we propose a novel paradigm which leverages the conclusions of probability theory and the tractability of the robust optimization approach to approximate and optimize the expected behavior in a given system. Our framework models the uncertainty via polyhedral sets inspired by the limit laws of probability. We characterize the uncertainty sets by variability parameters that we treat as random variables. We then devise a methodology to approximate and optimize the average performance of the system via a robust optimization formulation. Our framework (a) avoids the challenges of fitting probability distributions to the uncertain variables, (b) eliminates the need to generate scenarios to describe the states of randomness, and (c) demonstrates the use of robust optimization to evaluate and optimize expected performance. We illustrate the applicability of our methodology to analyze the performance of queueing networks and optimize the inventory policy for supply chain networks. In Part I, we study the case of a single queue. We develop a robust theory to study multi-server queues with possibly heavy-tailed primitives. Our methodology (a) provides approximations that match the diffusion approximations for light-tailed queues in heavy traffic, and (b) extends the framework to analyze the transient behavior of heavy-tailed queues. In Part II, we study the case of a network of queues. Our methodology provides accurate approximations of (a) the expected steady-state behavior in generalized queueing networks, and (b) the expected transient behavior in feedforward queueing networks. Our approach achieves significant computational tractability and provides accurate approximations relative to simulated values. In Part III, we study the case of a supply chain network. Our methodology (a) obtains optimal base-stock levels that match the optimal solutions obtained via stochastic optimization, (b) yields optimal affine policies which oftentimes exhibit better results compared to optimal base-stock policies, and (c) provides optimal policies that consistently outperform the solutions obtained via the traditional robust optimization approach. by Nataly Youssef. Ph. D. 2016-06-22T17:51:44Z 2016-06-22T17:51:44Z 2016 2016 Thesis http://hdl.handle.net/1721.1/103246 951626213 eng 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 174 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Operations Research Center. Youssef, Nataly Stochastic analysis via robust optimization |
| title | Stochastic analysis via robust optimization |
| title_full | Stochastic analysis via robust optimization |
| title_fullStr | Stochastic analysis via robust optimization |
| title_full_unstemmed | Stochastic analysis via robust optimization |
| title_short | Stochastic analysis via robust optimization |
| title_sort | stochastic analysis via robust optimization |
| topic | Operations Research Center. |
| url | http://hdl.handle.net/1721.1/103246 |
| work_keys_str_mv | AT youssefnataly stochasticanalysisviarobustoptimization |