<?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-22T08:36:42Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/7615" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/7615</identifier><datestamp>2026-05-14T13:55:50Z</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">Kunnumkal, Sumit</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-23T18:43:29Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-05-23T06:39:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-05-23T18:43:29Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/7615</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476288</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis, we  develop approximate dynamic programming and stochastic approximation methods for problems in inventory control and revenue management. A unifying feature of the methods we develop is that they exploit the underlying problem structure. By doing so, we are able to&#xd;
establish certain theoretical properties of our methods, make them more computationally efficient and obtain a faster rate of&#xd;
convergence.&#xd;
&#xd;
&#xd;
In the stochastic approximation framework, we develop an algorithm for the monotone estimation problem that uses a projection operator with respect to the max norm onto the order simplex. We show the almost sure convergence of this algorithm and present applications to the Q-learning algorithm and the newsvendor problem with censored demands. Next, we consider a number of inventory control problems for which the so-called base-stock policies are known to be&#xd;
optimal. We propose stochastic approximation methods to compute the optimal base-stock levels. Existing methods in the literature have only local convergence guarantees. In contrast, we show that the iterates of our methods converge to base-stock levels that are globally optimal. Finally, we consider the revenue management&#xd;
problem of optimally allocating seats on a single flight leg to&#xd;
demands from multiple fare classes that arrive sequentially. We&#xd;
propose a stochastic approximation algorithm to compute the optimal&#xd;
protection levels. The novel aspect of our method is that it works&#xd;
with the nonsmooth version of the problem where capacity can only be&#xd;
allocated in integer quantities. We show that the iterates of our&#xd;
algorithm converge to the globally optimal protection levels.&#xd;
&#xd;
&#xd;
&#xd;
In the approximate dynamic programming framework, we use a&#xd;
Lagrangian relaxation strategy to make the inventory control&#xd;
decisions in a distribution system consisting of multiple retailers&#xd;
that face random demand and a warehouse that supplies the retailers.&#xd;
Our method is based on relaxing the constraints that ensure  the&#xd;
nonnegativity of the shipments to the retailers by associating&#xd;
Lagrange multipliers to them. We show that our method naturally&#xd;
provides a lower bound on the optimal objective value. Furthermore,&#xd;
a good set of Lagrange multipliers can be obtained by&#xd;
solving a convex optimization problem.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">860584 bytes</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">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Approximate dynamic programming</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Stochastic approximation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Revenue management</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Inventory control</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or 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="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">Kunnumkal, Sumit</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="6a6537de-7a6e-4866-998b-7588da6ca024">
	&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>Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007-05-23T18:43:29Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Kunnumkal, Sumit&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;Keyword>Approximate dynamic programming&lt;/Keyword>
    &lt;Keyword>Stochastic approximation&lt;/Keyword>
    &lt;Keyword>Revenue management&lt;/Keyword>
    &lt;Keyword&gt;Inventory control&lt;/Keyword>
   	&lt;Abstract>In this thesis, we  develop approximate dynamic programming and stochastic approximation methods for problems in inventory control and revenue management. A unifying feature of the methods we develop is that they exploit the underlying problem structure. By doing so, we are able to&#xd;
establish certain theoretical properties of our methods, make them more computationally efficient and obtain a faster rate of&#xd;
convergence.&#xd;
&#xd;
&#xd;
In the stochastic approximation framework, we develop an algorithm for the monotone estimation problem that uses a projection operator with respect to the max norm onto the order simplex. We show the almost sure convergence of this algorithm and present applications to the Q-learning algorithm and the newsvendor problem with censored demands. Next, we consider a number of inventory control problems for which the so-called base-stock policies are known to be&#xd;
optimal. We propose stochastic approximation methods to compute the optimal base-stock levels. Existing methods in the literature have only local convergence guarantees. In contrast, we show that the iterates of our methods converge to base-stock levels that are globally optimal. Finally, we consider the revenue management&#xd;
problem of optimally allocating seats on a single flight leg to&#xd;
demands from multiple fare classes that arrive sequentially. We&#xd;
propose a stochastic approximation algorithm to compute the optimal&#xd;
protection levels. The novel aspect of our method is that it works&#xd;
with the nonsmooth version of the problem where capacity can only be&#xd;
allocated in integer quantities. We show that the iterates of our&#xd;
algorithm converge to the globally optimal protection levels.&#xd;
&#xd;
&#xd;
&#xd;
In the approximate dynamic programming framework, we use a&#xd;
Lagrangian relaxation strategy to make the inventory control&#xd;
decisions in a distribution system consisting of multiple retailers&#xd;
that face random demand and a warehouse that supplies the retailers.&#xd;
Our method is based on relaxing the constraints that ensure  the&#xd;
nonnegativity of the shipments to the retailers by associating&#xd;
Lagrange multipliers to them. We show that our method naturally&#xd;
provides a lower bound on the optimal objective value. Furthermore,&#xd;
a good set of Lagrange multipliers can be obtained by&#xd;
solving a convex optimization problem.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>