lp_toolbox.m

线性规划算法

f=[-400 -400 -400 -300 -300 -300 -100 -100 -100];
A=[1  0  0  1  0  0  1  0  0;
   0  1  0  0  1  0  0  1  0;
   0  0  1  0  0  1  0  0  1;
   3  0  0  2  0  0  1  0  0;
   0  3  0  0  2  0  0  1  0;
   0  0  3  0  0  2  0  0  1;
   1  1  1  0  0  0  0  0  0;
   0  0  0  1  1  1  0  0  0;
   0  0  0  0  0  0  1  1  1;
  -1  0  0  0  0  0  0  0  0;
   0 -1  0  0  0  0  0  0  0;
   0  0 -1  0  0  0  0  0  0;
   0  0  0 -1  0  0  0  0  0;
   0  0  0  0 -1  0  0  0  0;
   0  0  0  0  0 -1  0  0  0;
   0  0  0  0  0  0 -1  0  0;
   0  0  0  0  0  0  0 -1  0;
   0  0  0  0  0  0  0  0 -1];
b=[400 600 300 600 800 375 600 500 325 0 0 0 0 0 0 0 0 0]';
Aeq=[   6 -4  0  6 -4  0  6 -4  0;
        0 -3  6  0 -3  6  0 -3  6 ];
beq=[0 0]';
[X,FVAL,EXITFLAG,OUTPUT,LAMBDA]=LINPROG(f,A,b,Aeq,beq)
f_max=-FVAL