Computing Provably Near-optimal Policies for Stochastic Inventory Control Models
Author: Retsef Levi
Publisher:
Published: 2005
Total Pages: 250
ISBN-13:
DOWNLOAD EBOOKRead and Download eBook Full
Author: Retsef Levi
Publisher:
Published: 2005
Total Pages: 250
ISBN-13:
DOWNLOAD EBOOKAuthor: Cong Shi (Ph.D.)
Publisher:
Published: 2012
Total Pages: 165
ISBN-13:
DOWNLOAD EBOOKMany if not most of the core problems studied in operations management fall into the category of multi-stage stochastic optimization models, whereby one considers multiple, often correlated decisions to optimize a particular objective function under uncertainty on the system evolution over the future horizon. Unfortunately, computing the optimal policies is usually computationally intractable due to curse of dimensionality. This thesis is focused on providing provably near-optimal and tractable policies for some of these challenging models arising in the context of inventory control, capacity planning and revenue management; specifically, on the design of approximation algorithms that admit worst-case performance guarantees. In the first chapter, we develop new algorithmic approaches to compute provably near-optimal policies for multi-period stochastic lot-sizing inventory models with positive lead times, general demand distributions and dynamic forecast updates. The proposed policies have worst-case performance guarantees of 3 and typically perform very close to optimal in extensive computational experiments. We also describe a 6-approximation algorithm for the counterpart model under uniform capacity constraints. In the second chapter, we study a class of revenue management problems in systems with reusable resources and advanced reservations. A simple control policy called the class selection policy (CSP) is proposed based on solving a knapsack-type linear program (LP). We show that the CSP and its variants perform provably near-optimal in the Halfin- Whitt regime. The analysis is based on modeling the problem as loss network systems with advanced reservations. In particular, asymptotic upper bounds on the blocking probabilities are derived. In the third chapter, we examine the problem of capacity planning in joint ventures to meet stochastic demand in a newsvendor-type setting. When resources are heterogeneous, there exists a unique revenue-sharing contract such that the corresponding Nash Bargaining Solution, the Strong Nash Equilibrium, and the system optimal solution coincide. The optimal scheme rewards every participant proportionally to her marginal cost. When resources are homogeneous, there does not exist a revenue-sharing scheme which induces the system optimum. Nonetheless, we propose provably good revenue-sharing contracts which suggests that the reward should be inversely proportional to the marginal cost of each participant.
Author: Jing-Sheng J. Song
Publisher: Edward Elgar Publishing
Published: 2023-08-14
Total Pages: 565
ISBN-13: 180037710X
DOWNLOAD EBOOKThis comprehensive Handbook provides an overview of state-of-the-art research on quantitative models for inventory management. Despite over half a century’s progress, inventory management remains a challenge, as evidenced by the recent Covid-19 pandemic. With an expanse of world-renowned inventory scholars from major international research universities, this Handbook explores key areas including mathematical modelling, the interplay of inventory decisions and other business decisions and the unique challenges posed to multiple industries.
Author: Edward K. Baker
Publisher: Springer Science & Business Media
Published: 2007-04-30
Total Pages: 266
ISBN-13: 038748793X
DOWNLOAD EBOOKThis book represents the results of cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state-of-the-art in the interface between OR/MS and CS/AI and of the high caliber of research being conducted by members of the INFORMS Computing Society.
Author: ACM Special Interest Group for Algorithms and Computation Theory
Publisher:
Published: 2006
Total Pages: 790
ISBN-13:
DOWNLOAD EBOOKAuthor:
Publisher:
Published: 1969
Total Pages:
ISBN-13:
DOWNLOAD EBOOKAuthor: D.T. Lee
Publisher: Springer Science & Business Media
Published: 2010-07-12
Total Pages: 349
ISBN-13: 3642145523
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 4th International Frontiers of Algorithmics Workshop, FAW 2010, held in Wuhan, China, in August 2010. The 28 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 57 submissions. The Workshop will provide a focused forum on current trends of research on algorithms, discrete structures, and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Workshop is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.
Author: Wang Chi Cheung
Publisher:
Published: 2017
Total Pages: 0
ISBN-13:
DOWNLOAD EBOOKWe study the classical multi-period capacitated stochastic inventory control problems in a data-driven setting. Instead of assuming full knowledge of the demand distributions, we assume that the demand distributions can only be accessed through drawing random samples. Such data-driven models are ubiquitous in practice, where the cumulative distribution functions of the underlying random demand are either unavailable or too complicated to work with. We apply the Sample Average Approximation (SAA) method to the capacitated inventory control problem and establish an upper bound on the number of samples needed for the SAA method to achieve a near-optimal expected cost, under any level of required accuracy and pre-specified confidence probability. The sample bound is polynomial in the number of time periods as well as the confidence and accuracy parameters. Moreover, the bound is independent of the underlying demand distributions. However, the SAA requires solving the SAA problem, which is #P-hard. Thus, motivated by the SAA analysis, we propose a randomized polynomial time approximation scheme which also uses polynomially many samples. Finally, we establish a lower bound on the number of samples required to solve this data-driven newsvendor problem to near-optimality.
Author: Van Anh Truong
Publisher:
Published: 2007
Total Pages: 262
ISBN-13:
DOWNLOAD EBOOKAuthor: Arthur F. Veinott (Jr.)
Publisher:
Published: 1964
Total Pages: 50
ISBN-13:
DOWNLOAD EBOOK