Turnpike sets in stochastic production planning problems

S. P. Sethi, H. M. Soner, Q. Zhang, J. Jiang

Research output: Contribution to journalConference article

1 Scopus citations

Abstract

Optimal infinite-horizon stochastic production planning problems with capacity and demand are considered to be finite state Markov chains. Turnpike set concepts are introduced to characterize the optimal inventory levels. It is shown that the turnpike set is an attractor set for the optimal trajectories provided that the capacity is assumed to be fixed at a level exceeding the maximum possible demand. Conditions under which the optimal trajectories enter the convex closure of the set in finite time are given. The structure of turnpike sets is described, and it is shown that the turnpike sets exhibit a monotone property with respect to capacity and demand. It turns out that the monotonicity property helps in solving the optimal production problem numerically and, in some cases, analytically.

Original languageEnglish (US)
Pages (from-to)590-595
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume2
DOIs
StatePublished - 1990
Externally publishedYes
EventProceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6) - Honolulu, HI, USA
Duration: Dec 5 1990Dec 7 1990

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Turnpike sets in stochastic production planning problems'. Together they form a unique fingerprint.

  • Cite this