2.3 解法3（IP）p104,107~108
将模型变换为以下的整数规划模型：
maxz?4.8(x11?x21)?5.6(x12?x22)?c(x)x11?x12?500?xx21?x22?1000x?1500x11?0.5x11?x21x12?0.6x12?x22x11,x12,x21,x22,x?0z1?y1,z2?y1?y2,z3?y2?y3,z4?y3z1?z2?z3?z4?1,zk?0(k?1,2,3,4)y1?y2?y3?1,y1,y2,y3?0或1x?z1b1?z2b2?z3b3?z4b4c(x)?z1c(b1)?z2c(b2)?z3c(b3)?z4c(b4)其中
b1=0, b2=500, b3=1000, b4=1500
c(b1)=0, c(b2)=5000, c(b3)=9000, c(b4)=12000 程序如下：
6
★ 输入模型并给出运行结果（全局最优解）（比较[106]）： 附：输入模型 sets: 7
pn_1/1..3/: y; pn/1..4/: z,b,c; endsets data: b=0 500 1000 1500; c=0 5000 9000 12000; enddata max= 4.8*x11 + 4.8*x21 + 5.6*x12 + 5.6*x22 - @sum(pn: c*z); x11 + x12 < x + 500; x21 + x22 < 1000; 0.5*x11 - 0.5*x21 > 0; 0.4*x12 - 0.6*x22 > 0; z(1) 0-1规划模型： min Z=66.8x11+75.6x12+87x13+58.6x14 +57.2x21+66x22+66.4x23+53x24 +78x31+67.8x32+84.6x33+59.4x34 +70x41+74.2x42+69.6x43+57.2x44 +67.4x51+71x52+83.8x53+62.4x54 subject to x11+x12+x13+x14<=1 x21+x22+x23+x24<=1 x31+x32+x33+x34<=1 x41+x42+x43+x44<=1 x11+x21+x31+x41+x51=1 x12+x22+x32+x42+x52=1 x13+x23+x33+x43+x53=1 x14+x24+x34+x44+x54=1 xij={0,1},i=1,2,3,4,5,j=1,2,3,4 程序如下： 8 9 ★ 输入以上0-1规划模型。给出运行结果（比较[110]）： 3.2 解法2 0-1规划模型： min z???cijxijj?1i?145s.t. ?xij?1, i?1,2,3,4,5j?154 ?xij?1, j?1,2,3,4i?1 xij?{0,1}其中 ?66.875.68758.6??57.26666.453???c??7867.884.659.4? ??7074.269.657.2????67.47183.862.4?? 10