【正文】 le cols= 5 Local optimal solution found at step: 6 Objective value: Branch count: 0 Variable Value Reduced Cost X1 Y1 X2 Y2 X3 Y3 X4 Y4 X5 Y5 Row Slack or Surplus Dual Price 1 2 3 4 5 6 7 8 9 10 對于模型2：LINGO程序如下：Max=*x1+*x2+*x3+*x4+*x5t*f*。x4=0。4*x1+10*x2x32*x43*x5=0。x1+x2+x3+x4+x5=1000。運算結果：Rows= 5 Vars= 5 No. integer vars= 0 ( all are linear) Nonzeros= 25 Constraint nonz= 18( 9 are + 1) DensitZ= Smallest and largest elements in abs value= No. : 3 No. =: 0 No. : 1, Obj=MAX, GUBs = 1 Single cols= 0 Global optimal solution found at step: 8 Objective value: Variable Value Reduced Cost X1 X2 X3 X4 X5 Row Slack or Surplus Dual Price 1 2 3 4 5 13