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:

  • Adaptive robust optimization with applications in inventory and revenue management 
    Iancu, Dan Andrei (Massachusetts Institute of Technology, 2010)
    In this thesis, we examine a recent paradigm for solving dynamic optimization problems under uncertainty, whereby one considers decisions that depend directly on the sequence of observed disturbances. The resulting policies, ...
  • Advances in airline revenue management and pricing 
    Boer, Sanne Vincent de, 1976- (Massachusetts Institute of Technology, 2003)
    We propose new models and optimization methods for airline revenue management and pricing. In the first part of this thesis, we study the dynamic inventory control problem for a single flight under imperfect market ...
  • Advances in electric power systems : robustness, adaptability, and fairness 
    Sun, Xu Andy (Massachusetts Institute of Technology, 2011)
    The electricity industry has been experiencing fundamental changes over the past decade. Two of the arguably most significant driving forces are the integration of renewable energy resources into the electric power system ...
  • Air traffic flow management at airports : a unified optimization approach 
    Frankovich, Michael Joseph (Massachusetts Institute of Technology, 2012)
    The cost of air traffic delays is well documented, and furthermore, it is known that the significant proportion of delays is incurred at airports. Much of the air traffic flow management literature focuses on traffic flows ...
  • Algorithmic and game-theoretic perspectives on scheduling 
    Uhan, Nelson A. (Nelson Alexander) (Massachusetts Institute of Technology, 2008)
    (cont.) Second, for almost all 0-1 bipartite instances, we give a lower bound on the integrality gap of various linear programming relaxations of this problem. Finally, we show that for almost all 0-1 bipartite instances, ...
  • Algorithmic issues in queueing systems and combinatorial counting problems 
    Katz-Rogozhnikov, Dmitriy A (Massachusetts Institute of Technology, 2008)
    (cont.) However, these randomized algorithms can never provide proven upper or lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms ...
  • Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs 
    Telha Cornejo, Claudio (Claudio A.) (Massachusetts Institute of Technology, 2012)
    In the first part of this thesis we present a new, geometric interpretation of the jump number problem on 2-dimensional 2-colorable (2D2C) partial order. We show that the jump number of a 2D2C poset is equivalent to the ...
  • Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations 
    Mittal, Shashi, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2011)
    This thesis presents efficient algorithms that give optimal or near-optimal solutions for problems with non-linear objective functions that arise in discrete, continuous and robust optimization. First, we present a general ...
  • Analysis of employee stock options and guaranteed withdrawal benefits for life 
    Shah, Premal (Premal Y.) (Massachusetts Institute of Technology, 2008)
    In this thesis we study three problems related to financial modeling. First, we study the problem of pricing Employee Stock Options (ESOs) from the point of view of the issuing company. Since an employee cannot trade or ...
  • Analytics for financing drug development 
    Fagnan, David Erik (Massachusetts Institute of Technology, 2015)
    Financing drug development has a particular set of challenges including long development times, high chance of failure, significant market valuation uncertainty, and high costs of development. The earliest stages of ...
  • Analytics for Improved Cancer Screening and Treatment 
    Silberholz, John (Massachusetts Institute of Technology, 2015)
    Cancer is a leading cause of death both in the United States and worldwide. In this thesis we use machine learning and optimization to identify effective treatments for advanced cancers and to identify effective screening ...
  • Analytics for online markets 
    Johnson, Kris (Kris Dianne) (Massachusetts Institute of Technology, 2015)
    Online markets are becoming increasingly important in today's world as more people gain access to the internet. Furthermore, the explosion of data that is collected via these online markets provides us with new opportunities ...
  • Applications of optimal portfolio management 
    Bisias, Dimitrios (Massachusetts Institute of Technology, 2015)
    This thesis revolves around applications of optimal portfolio theory. In the first essay, we study the optimal portfolio allocation among convergence trades and mean reversion trading strategies for a risk averse investor ...
  • Applications of optimization in probability, finance and revenue management 
    Popescu, Ioana (Massachusetts Institute of Technology, 1999)
  • Applications of robust optimization to queueing and inventory systems 
    Rikun, Alexander Anatolyevich (Massachusetts Institute of Technology, 2011)
    This thesis investigates the application of robust optimization in the performance analysis of queueing and inventory systems. In the first part of the thesis, we propose a new approach for performance analysis of queueing ...
  • An approximate dynamic programming approach to discrete optimization 
    Demir, Ramazan (Massachusetts Institute of Technology, 2000)
    We develop Approximate Dynamic Programming (ADP) methods to integer programming problems. We describe and investigate parametric, nonparametric and base-heuristic learning approaches to approximate the value function in ...
  • Approximation algorithms for packing and scheduling problems 
    Correa, José Rafael, 1975- (Massachusetts Institute of Technology, 2004)
    In this thesis we consider three combinatorial optimization problems. Specifically, we study packing and scheduling questions of relevance in several areas of operations research, including interconnection networks and ...
  • Buyout prices in online auctions 
    Gupta, Shobhit (Massachusetts Institute of Technology, 2006)
    Buyout options allow bidders to instantly purchase at a specified price an item listed for sale through an online auction. A temporary buyout option disappears once a regular bid above the reserve price is made, while a ...
  • Capacity expansion in contemporary telecommunication networks 
    Sivaraman, Raghavendran (Massachusetts Institute of Technology, 2007)
    We study three capacity expansion problems in contemporary long distance telecommunication networks. The first two problems, motivated by a major long distance provider, address capacity expansion in national hybrid long ...
  • The case for coordination : equity, efficiency and passenger impacts in air traffic flow management 
    Fearing, Douglas (Douglas Stephen) (Massachusetts Institute of Technology, 2010)
    In this thesis, we develop multi-resource integer optimization formulations for coordinating Traffic Flow Management (TFM) programs with equity considerations. Our multi-resource approaches ignore aircraft connectivity ...
MIT-Mirage