【正文】 8 9 10 11 12 靈敏度分析：Ranges in which the basis is unchanged: Objective Coefficient Ranges Current Allowable Allowable Variable Coefficient Increase Decrease X1 X2 INFINITY X3 INFINITY X4 INFINITY X5 INFINITY X6 INFINITY Righthand Side Ranges Row Current Allowable Allowable RHS Increase Decrease 2 INFINITY 3 INFINITY 4 INFINITY 5 6 INFINITY 7 INFINITY 8 INFINITY 9 INFINITY 10 INFINITY 11 INFINITY 12 INFINITY程序3：max=*x1+*x2+*x3+*x4+*x5+*x6。x1+x2+x3+x4+x5+x6=50。3*x1+10*x2+6*x3+2*x4+x5+5*x6=11*x1+15*x2+25*x3+20*x4+10*x5+12*x6=650。x1+3*x2+8*x3+6*x4+x5+2*x6=200。15*x2+30*x3+20*x4+5*x5+10*x6=500。x1=0。x2=0。x3=0。x4=0。x5=0。x6=0。運行結果如下： Global optimal solution found. Objective value: Total solver iterations: 2 Variable Value Reduced Cost X1 X2 X3 X4 X5 X6 Row Slack or Surplus Dual Price 1 2 3 4 5 6 7 8 9 10 11 12 程序4format short。c=[11 15 25 20 10 12]。A=[3 10 6 2 1 5。11 15 25 20 10 12。1 3 8 6 1 2。0 15 30 20 5 10]。b=[250 650 200 500]。Aeq=[1 1 1 1 1 1]。beq=[50]。xL=zeros(6,1)。xU=[]。[x,fmin]=linprog(c,A,b,Aeq,beq,xL,xU)。x,fmin=fmin/100運行結果如下：Optimization terminated.x = fmin =