Strong Planning and Forecast Horizons in a Convex Production Planning Problem.

Abstract

We consider a production-inventory planning problem with time varying demands, convex production costs, and a warehouse capacity constraint. It is solved by use of the Lagrangian form of the maximum principle. The possible existence of strong planning and forecast horizons is demonstrated. When they exist, they permit the breaking up of the whole problem into a set of smaller problems which can be solved independently, because optimal decisions up to a strong planning horizon are completely independent of demand data beyond the next forecast horizon. A forward branch and bound algorithm is developed to determine such horizons and to solve the whole problem. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1981
Accession Number
ADA104217

Entities

People

  • Gerald L. Thompson
  • Jinn-tsair Teng
  • Suresh P. Sethi

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Dynamic Programming
  • Equations
  • Equations Of State
  • Hamiltonian Functions
  • Intervals
  • Inventory
  • Production
  • Production Planning
  • Production Rate
  • Time Intervals
  • Universities

Readers

  • Logistics and Supply Chain Management.
  • Mathematical Modeling and Probability Theory.
  • Ocean-Atmosphere Mesoscale Modeling, Data Assimilation, and Flux Boundary Layers