✦ LIBER ✦

Envelope condition method versus endogenous grid method for solving dynamic programming problems

✍ Scribed by Maliar, Lilia; Maliar, Serguei

Book ID: 123305143
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 379 KB
Volume: 120
Category: Article
ISSN: 0165-1765
DOI: 10.1016/j.econlet.2013.04.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Goal Programming Method for Solving Fr

A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming

✍ Pal, B.B.; Basu, I. 📂 Article 📅 1995 🏛 Taylor and Francis Group 🌐 English ⚖ 367 KB

A quantitative method for solving proble

A quantitative method for solving problems of linear dynamic programming

✍ N.P. Naumov 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 804 KB

The method of endogenous gridpoints for

The method of endogenous gridpoints for solving dynamic stochastic optimization problems

✍ Christopher D. Carroll 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Method of conditional ε-subgradient for

Method of conditional ε-subgradient for solving convex programming problems

✍ S. V. Rzhevskii 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 538 KB

A graphical realization of the dynamic p

A graphical realization of the dynamic programming method for solving -hard combinatorial problems

✍ Alexander A. Lazarev; Frank Werner 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 656 KB

## a b s t r a c t In this paper, we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the

A two-grid method for solving elliptic p

A two-grid method for solving elliptic problems with inhomogeneous boundary conditions

✍ D.M. Bedivan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 393 KB