Scholarlink

Chapter 11 covers dynamic programming, beginning with the simplest of such problems, so-called knapsack problems. Bellman’s principle of optimality is introduced and the mathematical details of Bellman’s equation are outlined, along with the concept of recursion. Examples provided include a least-cost travel model and an optimal stopping problem.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Dynamic Programming

  • 章节

  • 发表日期：

    2025年

查看全文
  • Gerald Shively

摘要

Chapter 11 covers dynamic programming, beginning with the simplest of such problems, so-called knapsack problems. Bellman’s principle of optimality is introduced and the mathematical details of Bellman’s equation are outlined, along with the concept of recursion. Examples provided include a least-cost travel model and an optimal stopping problem.