Heuristics for Inventory Systems Based on Quadratic Approximation of L-Natural-Convex Value Functions

dc.contributor.advisor

Sun, Peng

dc.contributor.author

Wang, Kai

dc.date.accessioned

2014-05-14T19:19:46Z

dc.date.available

2014-05-14T19:19:46Z

dc.date.issued

2014

dc.department

Business Administration

dc.description.abstract

We propose an approximation scheme for single-product periodic-review inventory systems with L-natural-convex structure. We lay out three well-studied inventory models, namely the lost-sales system, the perishable inventory system, and the joint inventory-pricing problem. We approximate the value functions for these models by the class of L-natural-convex quadratic functions, through the technique of linear programming approach to approximate dynamic programming. A series of heuristics are derived based on the quadratic approximation, and their performances are evaluated by comparison with existing heuristics. We present the numerical results and show that our heuristics outperform the benchmarks for majority of cases and scale well with long lead times. In this dissertation we also discuss the alternative strategies we have tried but with unsatisfactory result.

dc.identifier.uri

https://hdl.handle.net/10161/8777

dc.subject

Business

dc.subject

Operations research

dc.subject

Approximate Dynamic Programming

dc.subject

Heuristics

dc.subject

Inventory System

dc.subject

L-Natural-Convex

dc.subject

Lost-Sales

dc.subject

Perishable

dc.title

Heuristics for Inventory Systems Based on Quadratic Approximation of L-Natural-Convex Value Functions

dc.type

Dissertation

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Wang_duke_0066D_12446.pdf
Size:
12.54 MB
Format:
Adobe Portable Document Format

Collections