【正文】 nd. Objective value: Infeasibilities: Total solver iterations: 8 Variable Value Reduced Cost X11 X12 X13 X14 X15 X21 X23 X24 X25 X31 14 X32 X33 X35 X34 Row Slack or Surplus Dual Price 1 2 3 4 5 6 7 8 9 10 11 12 13 14 附錄三：求解問題 2 的 LINGO 程序 min=*x11+*x12+*x13+*x14+*x15+*x21+*x23 +*x24+*x25+*x31+*x32+*x33+*x35。 x21+x23+x24+x25=。 x11+x21+x31=。 x12+x32=。 x13+x23+x33=。 x14+x24=。 x15+x25+x35=。 end 附錄四：附錄三的運行結果 Global optimal solution found. Objective value: Infeasibilities: Total solver iterations: 8 Variable Value Reduced Cost X11 X12 15 X13 X14 X15 X21 X23 X24 X25 X31 X32 X33 X35 Row Slack or Surplus Dual Price 1 2 3 4 5 6 7 8 9 10 11 12 13 14