貌似只能做些简单的规划问题!
先用with(simplex):调入单纯形法软件包。这时系统内最大、最小命令为解线性规划。
maximize(目标函数,{约束},变量类型) minimize(目标函数,{约束},变量类型)
目标函数必须是线性的,约束为等式或不等式,变量类型有NONNEGATIVE非负和 UNRESTRICTED无限制两种,省略为无限制。 例如:用一斤肉二斤菜四斤面包饺子、包子,包子每个用肉、菜、面分别为0.1,0.3,0.2斤,售价0.5元;饺子每个用肉、菜、面分别为0.015,0.04,0.01斤,售价0.06元。求各生产多少,收入最大?
>with(simplex):maximize(0.5*x+0.06*y,{0.1*x+0.015*y<=1,0.3*x+0.04*y<=2,0.2*x+0.01*y<=4,x=3},NONNEGATIVE);assign(");subs(",0.5*x+0.06*y);
|