第一章 线性规划和单纯形方法.ppt

* CB XB b x1 x2 x3 x4 x5 θ 1 2 0 0 0 0 x3 4 1 0 1 0 0 0 x4 3 0 1 0 1 0 0 x5 8 1 2 0 0 1 Z=9 σ 1 2 0 0 0 - 3 4 * CB XB b x1 x2 x3 x4 x5 θ 1 2 0 0 0 0 x3 0 x4 0 x5 2 1 0 0 -2 1 3 0 1 0 1 0 4 1 0 1 0 0 4 - 2 σ 1 0 0 -2 0 Z=6 x2 2 * CB XB b x1 x2 x3 x4 x5 θ 1 2 0 0 0 0 x3 2 x2 0 x5 2 1 0 0 -2 1 3 0 1 0 1 0 2 0 0 1 2 -1 1 3 - σ 0 0 0 0 -1 Z=8 x1 1 * CB XB b x1 x2 x3 x4 x5 θ 1 2 0 0 0 0 x3 2 x2 1 x1 4 1 0 1 0 0 2 0 1 -1/2 0 1/2 1 0 0 1/2 1 -1/2 σ 0 0 0 0 -1 Z=8 x4 0 * X(1)= (2,3) Z(1)=8 X(2)= (4,2) Z(2)=8 无穷多解 * (2) 最小值问题 例： 求 minZ=X1 -X2+X3 -3X5 X2+X3 - X4+2X5 = 6 X1+2X2 -2X4 = 5 2X2 + X4+3X5 +X6 = 8 X1 … X6 ?0 * CB XB b x1 x2 x3 x4 x5 x6 θ 1 -1 1 0 -3 0 1 x3 6 0 1 1 -1 2 0 1 x1 5 1 2 0 -2 0 0 0 x6 8 0 2 0 1 3 1 σ 0 -4 0 3 -5 0 Z=11 3 - 8/3 * CB XB b x1 x2 x3 x4 x5 x6 θ 1 -1 1 0 -3 0 1 x3 1 x1 0 x6 x5 -3 8/3 0 2/3 0 1/3 1 1/3 5 1 2 0 -2 0 0 2/3 0 -1/3 1 -5/3 0 -2/3 - 5/2 4 σ 0 -2/3 0 14/3 0 5/3 Z=-7/3 * CB XB b x1 x2 x3 x4 x5 x6 θ 1 -1 1 0 -3 0 1 x3 1 x1 -3 x5 x2 -1 1 -2/3 0 0 1 1 1/3 5/2 1/2 1 0 -1 0 0 3/2 1/6 0 1 -2 0 -2/3 σ 1/3 0 0 4 0 5/3 Z=-4 * (3)退化 maxZ=10X1 + 12X2 3X1+4X2 +X3 =6 4X1+ X2 +X4 =2 3X1 +2X2 +X5 =3 X1 …… X5?0 * 退化解 X *=(0, 3/2, 0, 1/2, 0)T Zmax=18 * 第五节 单纯形法的进一步讨论 (一) 大M法： 判定无解条件：当进行到最优表时，仍有人工变量在基中，且≠0，则说明原问题无可行解。 * 例1： maxZ= 6X1 +4X2 2X1 +3X2 ? 100 4X1 +2X2 ? 120 X1 =14 X2 ? 22 X1 X2 ?0 * maxZ=6X1+4X2-MX6 -MX7 2X1 +3X2 +X3 =100 4X1 +2X2 +X4 =120 X1