<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T09:12:10Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/59287" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/59287</identifier><datestamp>2026-05-15T19:46:13Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</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="author">Dong, James</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Muckstadt, John Anthony</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Jackson, Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Pender, Jamol J</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-10-23T13:20:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-10-23T13:20:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-05-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 10796</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 10813285</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/59287</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/X4D50K6F</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">10489371</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">We consider a single-location, single-period stock allocation problem (newsvendor-like problem) with n items in which demand rates, holding costs, and backorder costs vary across all products. Inventory levels are replenished at the end of each period instantaneously. We apply robust optimization under an uncertainty set that captures a risk pooling phenomenon across items to this problem. The number of constraints governing the uncertainty set grows linearly in the number of items. A closed form solution is presented for the single and two-item cases. For the general n item problem, we present a 2-approximation algorithm and demonstrate its asymptotic optimality. The experimental results confirm the value of the approximation algorithm and indicate that the average performance is close to optimal.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="rights" lang="*">Attribution-NonCommercial-NoDerivatives 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="*">https://creativecommons.org/licenses/by-nc-nd/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject">Operations research</dim:field>
   <dim:field mdschema="dc" element="subject">Inventory Theory</dim:field>
   <dim:field mdschema="dc" element="subject">Newsvendor Problem</dim:field>
   <dim:field mdschema="dc" element="subject">robust optimization</dim:field>
   <dim:field mdschema="dc" element="title">ROBUST MULTI-PRODUCT NEWSVENDOR PROBLEM UNDER A GLOBAL BUDGET OF UNCERTAINTY</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Operations Research</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Operations Research</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Dong, James</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="84db3570-9091-4f7a-b440-12ba6910ecdb">
	&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>en_US&lt;/Language>
   	&lt;Title>ROBUST MULTI-PRODUCT NEWSVENDOR PROBLEM UNDER A GLOBAL BUDGET OF UNCERTAINTY&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2018-05-30&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/X4D50K6F&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Dong, James&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by-nc-nd/4.0/&lt;/License>
    &lt;Keyword>Operations research&lt;/Keyword>
    &lt;Keyword>Inventory Theory&lt;/Keyword>
    &lt;Keyword>Newsvendor Problem&lt;/Keyword>
    &lt;Keyword>robust optimization&lt;/Keyword>
   	&lt;Abstract>We consider a single-location, single-period stock allocation problem (newsvendor-like problem) with n items in which demand rates, holding costs, and backorder costs vary across all products. Inventory levels are replenished at the end of each period instantaneously. We apply robust optimization under an uncertainty set that captures a risk pooling phenomenon across items to this problem. The number of constraints governing the uncertainty set grows linearly in the number of items. A closed form solution is presented for the single and two-item cases. For the general n item problem, we present a 2-approximation algorithm and demonstrate its asymptotic optimality. The experimental results confirm the value of the approximation algorithm and indicate that the average performance is close to optimal.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>