LP-based subgradient algorithm for joint pricing and inventory control problems
Name
311815436-MIT.pdf
Description
Full printable version
Size
5.44 MB
Format
Adobe PDF
Checksum (MD5)
1fe88ee7a34c5d157399236617070c7c
Author(s)
Rao, Tingting
Advisor(s)
Retsef Levi and Georgia Perakis.
Alternative Title
Linear programming-based subgradient algorithm for joint pricing and inventory control problems
Date Issued
2008
Publisher
Massachusetts Institute of Technology
Abstract
It is important for companies to manage their revenues and -reduce their costs efficiently. These goals can be achieved through effective pricing and inventory control strategies. This thesis studies a joint multi-period pricing and inventory control problem for a make-to-stock manufacturing system. Multiple products are produced under shared production capacity over a finite time horizon. The demand for each product is a function of the prices and no back orders are allowed. Inventory and production costs are linear functions of the levels of inventory and production, respectively. In this thesis, we introduce an iterative gradient-based algorithm. A key idea is that given a demand realization, the cost minimization part of the problem becomes a linear transportation problem. Given this idea, if we knew the optimal demand, we could solve the production problem efficiently. At each iteration of the algorithm, given a demand vector we solve a linear transportation problem and use its dual variables in order to solve a quadratic optimization problem that optimizes the revenue part and generates a new pricing policy. We illustrate computationally that this algorithm obtains the optimal production and pricing policy over the finite time horizon efficiently. The computational experiments in this thesis use a wide range of simulated data. The results show that the algorithm we study in this thesis indeed computes the optimal solution for the joint pricing and inventory control problem and is efficient as compared to solving a reformulation of the problem directly using commercial software. The algorithm proposed in this thesis solves large scale problems and can handle a wide range of nonlinear demand functions.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2008.
Includes bibliographical references (p. 93-94).
Subjects
Computation for Design and Optimization Program.
MIT Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
Terms of Use
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.
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.
Persistent DSpace Link
