Networks with Gains in Discrete Dynamic Programming

Yvo M. I. Dirickx and M. R. Rao
Additional contact information
Yvo M. I. Dirickx: International Institute of Management, Berlin, Germany
M. R. Rao: Graduate School of Management, University of Rochester, Rochester, New York

Management Science, 1974, vol. 20, issue 11, 1428-1431

Abstract: The simplex method is specialized for a special class of networks with gains arising in discounted deterministic Markov decision models.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.11.1428 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:20:y:1974:i:11:p:1428-1431

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().