文件名称:aaaaaPI
介绍说明－－下载内容均来自于网络，请自行研究使用
可以用来求解线性规划问题：如下，任务分配问题：某车间有甲、乙两台机床，可用于加工三种工件。假定这两台车床的可用台时数分别为800和900，三种工件的数量分别为400、600和500，且已知用三种不同车床加工单位数量不同工件所需的台时数和加工费用如下表。问怎样分配车床的加工任务，才能既满足加工工件的要求，又使加工费用最低？
-Can be used to solve linear programming problems: the following, the task allocation problem: a workshop A, B two machines can be used to process three kinds of workpiece. Assume that these two lathes available units 800 and 900, respectively, three the number of workpieces 400, 600 and 500, respectively, and the known number of units of three different lathe workpiece required number of units and processing The costs are as follows table. Asked how to allocate the lathe processing tasks, in order to both meet the requirements of the workpiece, but also the lowest processing costs?
-Can be used to solve linear programming problems: the following, the task allocation problem: a workshop A, B two machines can be used to process three kinds of workpiece. Assume that these two lathes available units 800 and 900, respectively, three the number of workpieces 400, 600 and 500, respectively, and the known number of units of three different lathe workpiece required number of units and processing The costs are as follows table. Asked how to allocate the lathe processing tasks, in order to both meet the requirements of the workpiece, but also the lowest processing costs?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
多核软件设计—蒙特卡罗法求PI.ppt