Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms

DOI10.1007/BF01949716MaRDI QIDQ4047402zbMATH OpenOpenAlexFDO

Authors Y. M. I. Dirickx

Publication date 1974

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01949716

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Hamilton-Jacobi theories (49L99)

Cites work

• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 3152615 (Why is no real title available?)
• scientific article; zbMATH DE number 3307136 (Why is no real title available?)
• Deterministic Discrete Dynamic Programming with Discount Factor Greater than One: Structure of Optimal Policies
• Discrete Dynamic Programming
• Finite state Markovian decision processes
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Objectives, Constraints, and Outcomes in Optimal Growth Models
• Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix

This page was built for publication: Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047402)