关于一道运筹学的问题。

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

set ORIG;   # origins (steel mills)
set DEST;   # destinations (factories)
set PROD;   # products
set TRUCK;  # trucks
param pallet_w;                 # weight of each pallet.
param rate {ORIG,PROD} > 0;     # tons per hour at origins
param avail {ORIG} >= 0;        # hours available at origins
param demand {DEST,PROD} >= 0;  # tons required at destinations
param capacity {TRUCK} >= 0;    # truck's capacity in num. of pallets.
param crew {TRUCK} >= 0;        # number of trucks available
param make_cost {ORIG,PROD} >= 0;        # manufacturing cost/ton
param truck_cost {ORIG,DEST,TRUCK} >= 0;  # shipping cost/ton
param fix_cost {ORIG, PROD} >= 0;              # fixed costs
var Make {ORIG,PROD} >= 0;                  # tons produced at origins
var Prod {ORIG,PROD} binary;                # =1 produced, =0, not produced
var Pallets{ORIG,DEST,PROD} integer, >= 0;  # pallets shipped
var Trucks {ORIG,DEST, TRUCK} integer, >=0; # num. of trucks used
#minimize Total_Cost: sum{i in ORIG, j in DEST, l in TRUCK} Trucks[i,j,l];
minimize Total_Cost:
  sum {i in ORIG, p in PROD}             make_cost[i,p] * Make[i,p] +
  sum {i in ORIG, j in DEST, l in TRUCK} truck_cost[i,j,l] * Trucks[i,j,l] +
  sum {i in ORIG, p in PROD}             fix_cost[i,p] * Prod[i,p];


这道题目怎么做啊？如果火车的数量最少是10辆给条路线。

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：运筹学 destination Available produced Capacity available capacity required trucks number