Show simple item record

dc.contributor.advisorRetsef Levi and Georgia Perakis.en_US
dc.contributor.authorUichanco, Joline Ann Villarandaen_US
dc.contributor.otherMassachusetts Institute of Technology. Computation for Design and Optimization Program.en_US
dc.date.accessioned2008-05-19T16:12:39Z
dc.date.available2008-05-19T16:12:39Z
dc.date.copyright2007en_US
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/41728
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.en_US
dc.descriptionIncludes bibliographical references (p. 125-127).en_US
dc.description.abstractIn this thesis, we consider the classical newsvendor model and various important extensions. We do not assume that the demand distribution is known, rather the only information available is a set of independent samples drawn from the demand distribution. In particular, the variants of the model we consider are: the classical profit-maximization newsvendor model, the risk-averse newsvendor model and the price-setting newsvendor model. If the explicit demand distribution is known, then the exact solutions to these models can be found either analytically or numerically via simulation methods. However, in most real-life settings, the demand distribution is not available, and usually there is only historical demand data from past periods. Thus, data-driven approaches are appealing in solving these problems. In this thesis, we evaluate the theoretical and empirical performance of nonparametric and parametric approaches for solving the variants of the newsvendor model assuming partial information on the distribution. For the classical profit-maximization newsvendor model and the risk-averse newsvendor model we describe general non-parametric approaches that do not make any prior assumption on the true demand distribution. We extend and significantly improve previous theoretical bounds on the number of samples required to guarantee with high probability that the data-driven approach provides a near-optimal solution. By near-optimal we mean that the approximate solution performs arbitrarily close to the optimal solution that is computed with respect to the true demand distributions.en_US
dc.description.abstract(cont.) For the price-setting newsvendor problem, we analyze a previously proposed simulation-based approach for a linear-additive demand model, and again derive bounds on the number of samples required to ensure that the simulation-based approach provides a near-optimal solution. We also perform computational experiments to analyze the empirical performance of these data-driven approaches.en_US
dc.description.statementofresponsibilityby Joline Ann Villaranda Uichanco.en_US
dc.format.extent127 p.en_US
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/7582en_US
dc.subjectComputation for Design and Optimization Program.en_US
dc.titleData-driven revenue managementen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computation for Design and Optimization Program
dc.identifier.oclc225077150en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record