<?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-19T20:42:50Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/57550" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/57550</identifier><datestamp>2022-01-13T07:54:53Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</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">Restef Levi.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Yu, Qian, S.M. Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Computation for Design and Optimization Program</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-08-26T15:23:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-08-26T15:23:25Z</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/57550</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">640141077</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 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. 67-68).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">We study a periodic-reviewed, infinite horizon serial network inventory control problem. The demands in different periods are independent of each other and follow an identical Poisson distribution. Unsatisfied demands are backlogged until they are satisfied by supply units. In each period, there is a per-unit holding cost is incurred for each unit of supply that stays in the system and a per-unit backorder cost is incurred for each unsatisfied unit of demand. The objective of the inventory control policy is to minimize the long-run expected average cost over an infinite horizon. The goal of the thesis is to evaluate the empirical performance of the dual balancing policy and several other variants of cost balancing policies through numerical simulations. The dual-balancing policy is based on two novel ideas: the marginal cost accounting scheme, which assigns to each decision all the costs that are made inevitable after that decision is made; and the cost balancing idea to balance opposing costs.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">(cont.) The dual-balancing policy can be modified in several ways to get other cost balancing policies. It has been proven that the dual-balancing policy has a worst-case guarantee of 2 but this does not indicate the empirical performance. An approximately optimal policy is considered as the benchmark to test the quality of the cost balancing policies. In the computational experiments, the dual-balancing policy shows an average error of 7.74% compared to the approximately optimal policy, much better than the theoretical worst-case guarantee. The three variants of cost balancing policies have made significant improvement on the performance of the dual-balancing policy. The accuracy of the dual-balancing policy is also affected by the system parameters. In addition, with high demand rate and long lead times, we have observed several scenarios when the cost balancing policies dominate the approximately optimal policy.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Qian Yu.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">68 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">Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems</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="authorsordered">false</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="38681fe7-50fa-4e78-8844-80d475b92aaf">
	&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>Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2010&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Yu, Qian, S.M. Massachusetts Institute of Technology&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>Computation for Design and Optimization Program.&lt;/Keyword>
   	&lt;Abstract>We study a periodic-reviewed, infinite horizon serial network inventory control problem. The demands in different periods are independent of each other and follow an identical Poisson distribution. Unsatisfied demands are backlogged until they are satisfied by supply units. In each period, there is a per-unit holding cost is incurred for each unit of supply that stays in the system and a per-unit backorder cost is incurred for each unsatisfied unit of demand. The objective of the inventory control policy is to minimize the long-run expected average cost over an infinite horizon. The goal of the thesis is to evaluate the empirical performance of the dual balancing policy and several other variants of cost balancing policies through numerical simulations. The dual-balancing policy is based on two novel ideas: the marginal cost accounting scheme, which assigns to each decision all the costs that are made inevitable after that decision is made; and the cost balancing idea to balance opposing costs.&lt;/Abstract>
   	&lt;Abstract>(cont.) The dual-balancing policy can be modified in several ways to get other cost balancing policies. It has been proven that the dual-balancing policy has a worst-case guarantee of 2 but this does not indicate the empirical performance. An approximately optimal policy is considered as the benchmark to test the quality of the cost balancing policies. In the computational experiments, the dual-balancing policy shows an average error of 7.74% compared to the approximately optimal policy, much better than the theoretical worst-case guarantee. The three variants of cost balancing policies have made significant improvement on the performance of the dual-balancing policy. The accuracy of the dual-balancing policy is also affected by the system parameters. In addition, with high demand rate and long lead times, we have observed several scenarios when the cost balancing policies dominate the approximately optimal policy.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>