Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Networks with Gains in Discrete Dynamic Programming

Networks with Gains in Discrete Dynamic Programming The simplex method is specialized for a special class of networks with gains arising in discounted deterministic Markov decision models. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Management Science INFORMS

Networks with Gains in Discrete Dynamic Programming

Management Science , Volume 20 (11): 4 – Jul 1, 1974
5 pages

Loading next page...
 
/lp/informs/networks-with-gains-in-discrete-dynamic-programming-TB1ClzaYC0

References (3)

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0025-1909
eISSN
1526-5501
DOI
10.1287/mnsc.20.11.1428
Publisher site
See Article on Publisher Site

Abstract

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

Journal

Management ScienceINFORMS

Published: Jul 1, 1974

There are no references for this article.