<?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-18T18:54:57Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/8509" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/8509</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">Pachamanova, Dessislava A. (Dessislava Angelova), 1975-</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">2005-08-23T20:43:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-08-23T20:43:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2002</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2002</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/8509</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">50771481</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, 2002.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 137-141).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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 feasible for any realization of the uncertain coefficients within prescribed uncertainty sets. The focus of this thesis is on robust linear programming problems in which the uncertainty sets are polytopes. The assumption of polyhedral uncertainty leads to compact, efficiently solvable linear formulations. In the first part of the thesis, we study special types of polyhedral uncertainty sets that allow for incorporating moment information about the distribution of the uncertain coefficients, and for controlling the tradeoff between robustness and optimality. We provide probabilistic guarantees on the feasibility of optimal solutions obtained with such uncertainty sets for any realization of the uncertain coefficients. We then illustrate the versatility of robust polyhedral formulations by studying three financial applications: single period portfolio optimization, multiperiod portfolio management, and credit risk estimation. In the area of single period portfolio optimization, we propose ways of modeling inaccuracy in parameter estimates, and explore the benefits of robust optimal strategies through computational experiments with the statistical estimation of a particular measure of portfolio risk - sample shortfall. We emphasize the advantages of linear, as opposed to nonlinear, robust formulations in large portfolio problems with integrality constraints.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">(cont.) In the area of multiperiod portfolio management, we propose robust polyhedral formulations that use some minimal information about long-term direction of movement of asset returns to make informed decisions about portfolio rebalancing over the short term. The suggested formulations allow for including considerations of transaction costs and taxes while keeping the dimension of the problem low. In the area of credit risk estimation, we propose a model for estimating the survival probability distribution and the fair prices of credit risky bonds from market prices of similar credit risky securities. We address the issue of uncertainty in key parameters of the model, such as discount factors, by using robust optimization modeling. We also suggest a method for classification of credit risky bonds based on integer programming techniques.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Dessislava A. Pachamanova.</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">141 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">8588048 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">8587802 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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">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">A robust optimization approach to finance</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="3016f2eb-39fb-4bc2-9736-0346ce77a195">
	&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>A robust optimization approach to finance&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2002&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Pachamanova, Dessislava A. (Dessislava Angelova), 1975-&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>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 feasible for any realization of the uncertain coefficients within prescribed uncertainty sets. The focus of this thesis is on robust linear programming problems in which the uncertainty sets are polytopes. The assumption of polyhedral uncertainty leads to compact, efficiently solvable linear formulations. In the first part of the thesis, we study special types of polyhedral uncertainty sets that allow for incorporating moment information about the distribution of the uncertain coefficients, and for controlling the tradeoff between robustness and optimality. We provide probabilistic guarantees on the feasibility of optimal solutions obtained with such uncertainty sets for any realization of the uncertain coefficients. We then illustrate the versatility of robust polyhedral formulations by studying three financial applications: single period portfolio optimization, multiperiod portfolio management, and credit risk estimation. In the area of single period portfolio optimization, we propose ways of modeling inaccuracy in parameter estimates, and explore the benefits of robust optimal strategies through computational experiments with the statistical estimation of a particular measure of portfolio risk - sample shortfall. We emphasize the advantages of linear, as opposed to nonlinear, robust formulations in large portfolio problems with integrality constraints.&lt;/Abstract>
   	&lt;Abstract>(cont.) In the area of multiperiod portfolio management, we propose robust polyhedral formulations that use some minimal information about long-term direction of movement of asset returns to make informed decisions about portfolio rebalancing over the short term. The suggested formulations allow for including considerations of transaction costs and taxes while keeping the dimension of the problem low. In the area of credit risk estimation, we propose a model for estimating the survival probability distribution and the fair prices of credit risky bonds from market prices of similar credit risky securities. We address the issue of uncertainty in key parameters of the model, such as discount factors, by using robust optimization modeling. We also suggest a method for classification of credit risky bonds based on integer programming techniques.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>