Note--A Computational Refinement for Discrete-Valued Dynamic Programs with Convex Functions

Don R. Robinson
Additional contact information
Don R. Robinson: Illinois State University

Management Science, 1977, vol. 23, issue 11, 1251-1255

Abstract: A search procedure is presented for discrete-valued dynamic programming problems with the objective of minimising the sum of convex functions. This procedure may be more efficient than available methods if the sum is to be minimized over a uniform grid of values of the state variable. Furthermore, the procedure can be used to reduce the computational effort if only some of the return functions have a special structure.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.11.1251 (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:23:y:1977:i:11:p:1251-1255

Access Statistics for this article

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