Approximate Order Policies

Steven Nahmias ()
Additional contact information
Steven Nahmias: Santa Clara University

Chapter Chapter 5 in Perishable Inventory Systems, 2011, pp 33-40 from Springer

Abstract: Abstract Because optimal policies require the solution of an m – 1 dimensional dynamic program, finding optimal policies is feasible only for moderately small values of m. For that reason, approximate policies are of particular interest. The first issue to be addressed when trying to find approximations is the form of the approximate policy. When perishability is not present, we know that an optimal policy is a function of the total inventory on hand. A reasonable starting point is to restrict attention to policies that are only a function of the total starting stock in any period, independent of the age distribution of stock. (As we see, this approach has pitfalls as well.)

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-7999-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9781441979995

DOI: 10.1007/978-1-4419-7999-5_5

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().