<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-18T22:52:15Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/57538" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/57538</identifier><datestamp>2022-01-13T07:54:48Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131022</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Dimitris J. Bertsimas.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Doan, Xuan Vinh</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Operations Research Center</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Sloan School of Management</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-08-26T15:20:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-08-26T15:20:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2010</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/57538</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">635510942</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2010.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">This electronic version was submitted by the student author.  The certified thesis is available in the Institute Archives and Special Collections.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from student submitted PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 151-156).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">We study the problem of moments and present two diverse applications that apply both the hierarchy of moment relaxation and the moment duality theory. We then propose a moment-based uncertainty model for stochastic optimization problems, which addresses the ambiguity of probability distributions of random parameters with a minimax decision rule. We establish the model tractability and are able to construct explicitly the extremal distributions. The quality of minimax solutions is compared with that of solutions obtained from other approaches such as data-driven and robust optimization approach. Our approach shows that minimax solutions hedge against worst-case distributions and usually provide low cost variability. We also extend the moment-based framework for multi-stage stochastic optimization problems, which yields a tractable model for exogenous random parameters and affine decision rules. Finally, we investigate the application of data-driven approach with risk aversion and robust optimization approach to solve staffing and routing problem for large-scale call centers. Computational results with real data of a call center show that a simple robust optimization approach can be more efficient than the data-driven approach with risk aversion.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Xuan Vinh Doan.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Ph.D.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">156 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Optimization under moment, robust, and data-driven models of uncertainty</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="794390b9-ea2b-4e90-a8d3-1582f0ea4395">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Optimization under moment, robust, and data-driven models of uncertainty&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2010&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Doan, Xuan Vinh&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Operations Research Center.&lt;/Keyword>
   	&lt;Abstract>We study the problem of moments and present two diverse applications that apply both the hierarchy of moment relaxation and the moment duality theory. We then propose a moment-based uncertainty model for stochastic optimization problems, which addresses the ambiguity of probability distributions of random parameters with a minimax decision rule. We establish the model tractability and are able to construct explicitly the extremal distributions. The quality of minimax solutions is compared with that of solutions obtained from other approaches such as data-driven and robust optimization approach. Our approach shows that minimax solutions hedge against worst-case distributions and usually provide low cost variability. We also extend the moment-based framework for multi-stage stochastic optimization problems, which yields a tractable model for exogenous random parameters and affine decision rules. Finally, we investigate the application of data-driven approach with risk aversion and robust optimization approach to solve staffing and routing problem for large-scale call centers. Computational results with real data of a call center show that a simple robust optimization approach can be more efficient than the data-driven approach with risk aversion.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>