Advanced Search
DSpace@MIT

Browsing Operations Research - Ph.D. / Sc.D. by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research - Ph.D. / Sc.D. by Title

Sort by: Order: Results:

  • Nguyen, Tri-Dung, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2009)
    Classical methods of maximum likelihood and least squares rely a great deal on the correctness of the model assumptions. Since these assumptions are only approximations of reality, many robust statistical methods have been ...
  • McCann, Lauren, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2006)
    In this thesis, we study the problems of robust model selection and outlier detection in linear regression. The results of data analysis based on linear regressions are highly sensitive to model choice and the existence ...
  • Sim, Melvyn, 1971- (Massachusetts Institute of Technology, 2004)
    We propose new methodologies in robust optimization that promise greater tractability, both theoretically and practically than the classical robust framework. We cover a broad range of mathematical optimization problems, ...
  • Pachamanova, Dessislava A. (Dessislava Angelova), 1975- (Massachusetts Institute of Technology, 2002)
    An important issue in real-world optimization problems is how to treat uncertain coefficients. Robust optimization is a modeling methodology that takes a deterministic view: the optimal solution is required to remain ...
  • Aghassi, Michele Leslie (Massachusetts Institute of Technology, 2005)
    We propose a robust optimization approach to analyzing three distinct classes of problems related to the notion of equilibrium: the nominal variational inequality (VI) problem over a polyhedron, the finite game under payoff ...
  • Le Tallec, Yann (Massachusetts Institute of Technology, 2007)
    Markov Decision Processes (MDPs) model problems of sequential decision-making under uncertainty. They have been studied and applied extensively. Nonetheless, there are two major barriers that still hinder the applicability ...
  • Sethuraman, Jayachandran, 1970- (Massachusetts Institute of Technology, 1999)
  • Stier Moses, Nicolás E (Massachusetts Institute of Technology, 2004)
    A common assumption in network optimization models is that a central authority controls the whole system. However, in some applications there are independent users, and assuming that they will follow directions given by ...
  • Lobel, Ilan (Massachusetts Institute of Technology, 2009)
    This thesis studies the learning problem of a set of agents connected via a general social network. We address the question of how dispersed information spreads in social networks and whether the information is efficiently ...
  • Bimpikis, Kostas (Massachusetts Institute of Technology, 2010)
    This thesis studies optimal stopping problems for strategic agents in the context of two economic applications: experimentation in a competitive market and information exchange in social networks. The economic agents (firms ...
  • Nogueira, Alexandre Belloni (Massachusetts Institute of Technology, 2006)
    Convexity has played a major role in a variety of fields over the past decades. Nevertheless, the convexity assumption continues to reveal new theoretical paradigms and applications. This dissertation explores convexity ...
  • Mamani, Hamed (Massachusetts Institute of Technology, 2008)
    Annual influenza outbreaks incur great expenses in both human and monetary terms, and billions of dollars are being allocated for influenza pandemic preparedness in an attempt to avert even greater potential losses. ...
  • Bompadre, Agustín (Massachusetts Institute of Technology, 2005)
    In this thesis we study different combinatorial optimization problems. These problems arise in many practical settings where there is a need for finding good solutions fast. The first class of problems we study are vehicle ...
  • Pei, Pamela Pen-Erh (Massachusetts Institute of Technology, 2008)
    We present in this work a unified approach and provide the optimal solution to the pricing problem of option contracts for a supplier of an industrial good in the presence of spot trading. Specifically, our approach fully ...
  • Farahat, Amr, 1973- (Massachusetts Institute of Technology, 2004)
    (cont.) algorithm, at one extreme, and complete enumeration, at the other extreme. We derive worst-case approximation guarantees on the solution produced by such an algorithm for matroids. We then define a continuous ...
  • Keller, Philipp W. (Philipp Wilhelm), 1982- (Massachusetts Institute of Technology, 2013)
    We consider a retailer offering an assortment of differentiated substitutable products to price-sensitive customers. Prices are chosen to maximize profit, subject to inventory/ capacity constraints, as well as more general ...
  • Gupta, Shubham, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2012)
    We propose a tractable optimization framework for network Air Traffic Flow Management (ATFM) with an eye towards the future. The thesis addresses two issues in ATFM research: a) fairness and collaboration amongst airlines; ...
  • Bandi, Chaithanya (Massachusetts Institute of Technology, 2013)
    Modern probability theory, whose foundation is based on the axioms set forth by Kolmogorov, is currently the major tool for performance analysis in stochastic systems. While it offers insights in understanding such systems, ...
  • Beil, Damian (Massachusetts Institute of Technology, 2003)
    This thesis studies two operations management topics in online auctions, and is divided into two parts. Motivated by the increasing use of ShopBots to scan Internet auctions, the first part of the thesis analytically ...
  • Humair, Salal (Massachusetts Institute of Technology, 2001)
MIT-Mirage