KnapsackModel.pptVIP

  • 5
  • 0
  • 约3.8千字
  • 约 35页
  • 2017-02-28 发布于湖北
  • 举报
KnapsackModel

Notes 6 IE312 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack? Race Car Features Formulation Decision variables ILP LINGO Formulation Solve using Branch Bound What is the Relative Worth? Next Step? Next Level Next Steps … Capital Budgeting Multidimensional knapsack problems are often called capital budgeting problems Idea: select collection of projects, investments, etc, so that the value is maximized (subject to some resource constraints) NASA Capital Budgeting Formulation Decision variables Budget constraints Formulation Mut

文档评论(0)

1亿VIP精品文档

相关文档