Networks with Gains in Discrete Dynamic Programming

Yvo M. I. Dirickx
Yvo M. I. Dirickx
International Institute of Management, Berlin, Germany
Search for more papers by this author
,
M. R. Rao
M. R. Rao
Graduate School of Management, University of Rochester, Rochester, New York
Search for more papers by this author

Yvo M. I. Dirickx

Yvo M. I. Dirickx

International Institute of Management, Berlin, Germany

Search for more papers by this author

,

M. R. Rao

Graduate School of Management, University of Rochester, Rochester, New York

Search for more papers by this author

Published Online:1 Jul 1974https://doi.org/10.1287/mnsc.20.11.1428

Abstract

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

cover image Management Science

Volume 20, Issue 11

July 1974

Pages 1413-1496

Article Information

Metrics

Information

Published Online:July 01, 1974

© 1974 INFORMS

Cite as

Yvo M. I. Dirickx, M. R. Rao, (1974) Networks with Gains in Discrete Dynamic Programming. Management Science 20(11):1428-1431.

https://doi.org/10.1287/mnsc.20.11.1428