Linear and Dynamic Programming in Markov Chains

Yoav Kislev and Amotz Amiad

American Journal of Agricultural Economics, 1968, vol. 50, issue 1, 111-129

Abstract: Some essential elements of the Markov chain theory are reviewed, along with programming of economic models which incorporate Markovian matrices and whose objective function is the maximization of the present value of an infinite stream of income. The linear programming solution to these models is presented and compared to the dynamic programming solution. Several properties of the solution are analyzed and it is shown that the elements of the simplex tableau contain information relevant to the understanding of the programmed system. It is also shown that the model can be extended to cover, among other elements, multiprocess enterprises and the realistic cases of programming in the face of probable deterioration of the productive capacity of the system or its total destruction.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.2307/1237875 (application/pdf)
Access to full text is restricted to subscribers.

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:oup:ajagec:v:50:y:1968:i:1:p:111-129.

Access Statistics for this article

American Journal of Agricultural Economics is currently edited by Madhu Khanna, Brian E. Roe, James Vercammen and JunJie Wu

More articles in American Journal of Agricultural Economics from Agricultural and Applied Economics Association Contact information at EDIRC.
Bibliographic data for series maintained by Oxford University Press ().