Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms
type: Item
instance of: scholarly article
title: Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms
zbMATH Open document ID: 0294.90064
DOI: 10.1007/BF01949716
author: Y. M. I. Dirickx
published in: Zeitschrift für Operations Research
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 49L99
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3461762
MaRDI profile type: MaRDI publication profile
cites work: Discrete Dynamic Programming
cites work: Q3270185
cites work: Finite state Markovian decision processes
cites work: Deterministic Discrete Dynamic Programming with Discount Factor Greater than One: Structure of Optimal Policies
cites work: Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix
cites work: Q3266141
cites work: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
cites work: Objectives, Constraints, and Outcomes in Optimal Growth Models
cites work: Q5588251
full work available at URL: https://doi.org/10.1007/bf01949716
OpenAlex ID: W2078163775
description: scientific article