文件名称:product
- 所属分类:
- 数值算法/人工智能
- 资源属性:
- [Windows] [Visual.Net] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 448kb
- 下载次数:
- 0次
- 提 供 者:
- d*
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
2、 某工厂购进1000 台机器,准备生产p1 和p2 两种产品,若生产产品p1,每台机器每年
可收入4500 元,但机器损坏率达65%,若生产产品p2,每台机器每年可收入3500 元,
但机器损坏率达35%。三年后机器全部淘汰,购入新机器。应该如何安排生产(计划以
一年为周期),使三年内收入最多,用动态规划法编程求了此问题-2, 1000 purchased a factory machine, the production of ready p1 and p2 the two products, if the product p1, each machine income of 4,500 yuan each year, but the machine failure rate is about 65, if production p2, each machine per year income of 3,500 yuan may be, but the machine failure rate of 35. After three years of all-out machines, buy new machines. How should arrange production (plans to one-year cycle) so that a maximum of three years of income, using dynamic programming method for programming this issue
可收入4500 元,但机器损坏率达65%,若生产产品p2,每台机器每年可收入3500 元,
但机器损坏率达35%。三年后机器全部淘汰,购入新机器。应该如何安排生产(计划以
一年为周期),使三年内收入最多,用动态规划法编程求了此问题-2, 1000 purchased a factory machine, the production of ready p1 and p2 the two products, if the product p1, each machine income of 4,500 yuan each year, but the machine failure rate is about 65, if production p2, each machine per year income of 3,500 yuan may be, but the machine failure rate of 35. After three years of all-out machines, buy new machines. How should arrange production (plans to one-year cycle) so that a maximum of three years of income, using dynamic programming method for programming this issue
相关搜索: 生产计划
(系统自动生成,下载前可以参看下载内容)
下载文件列表
product
.......\debug
.......\product
.......\.......\Debug
.......\.......\product.cpp
.......\.......\product.vcproj
.......\.......\product.vcproj.DANISE.danis.user
.......\product.ncb
.......\product.sln
.......\debug
.......\product
.......\.......\Debug
.......\.......\product.cpp
.......\.......\product.vcproj
.......\.......\product.vcproj.DANISE.danis.user
.......\product.ncb
.......\product.sln