Polynomial approximation technique for dynamic optimization problems

DOI10.1016/0305-0548(86)90031-6zbMath0622.90088OpenAlexW1966906655MaRDI QIDQ1091280

David F. Dianich, Jatinder N. D. Gupta

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90031-6

zbMATH Keywords

discretizationpolynomial approximationvariational methodgeneral dynamic optimizationproduction and inventory smoothing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Dynamic programming (90C39)

Related Items (2)

Consumer buying behaviour and optimal advertising strategy: The quadratic profit function case ⋮ A Markovian model of consumer buying behavior and optimal advertising pulsing policy

Cites Work

• Dynamic programming, quasilinearization and the dimensionality difficulty
• Turnpike Horizons for Production Planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial approximation technique for dynamic optimization problems