SAS_OR_for_linear_plan_problem_of_iron_tube

所属分类:其他行业
开发工具:Others
文件大小:1KB
下载次数:2
上传日期:2010-01-05 13:57:55
上 传 者sxlion
说明:  用SAS解决线性规划问题举例: 问题:一批铁丝,数量不限,每一根铁丝长 1650 mm ,现需要截取下列品种、长度、数量的铁丝: 品种 长度/mm 需要数量/根 a1 303 10 a2 251 10 a3 202 10 a4 151 10 a5 107 10 注:铁丝的长度、品种的个数、品种的长度、需要数量都是变量。 怎样计算,在达到需要截取的品种、长度、数量的前提下,使用的铁丝根数最少,浪费的最小?
(SAS to solve linear programming problems with an example: Question: A group of wire, the number of open, every wire length 1650 mm, is a need for interception of the following species, length, amount of wire: Variety Length/mm required quantity/root a1 303 10 a2 251 10 a3 202 10 a4 151 10 a5 107 10 Note: The wire length, the number of species, species the length of the required quantities of the variable. How we calculate, in meeting the need of intercepted species, length, number of premise, using the least number of wire roots, wasting a minimum?)

文件列表:
SAS_OR_for_ linear_plan_problem_of_iron_tube .sas (2279, 2010-01-05)

近期下载者

相关文件


收藏者