Description: 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?
To Search:
File list (Check if you may need any files):
多核软件设计—蒙特卡罗法求PI.ppt
Download