shili081.m

来自「约束最优化」· M 代码 · 共 26 行

format short 
c=[-10,-9];
A=[6 5;10 20;1 0];
b=[60 150 8];
v1=[0 0];
[x,f,exitf,out,lag]=linprog(c,A,b,[],[],v1);
z=-f;
lag
x,z,lag.ineqlin,lag.lower
pause
' ----------------- question 1 ----------------'
b1=[61,150,8];
[x1,f,exitf,out,lag1]=linprog(c,A,b1,[],[],v1);
z1=-f;
x1,z1,lag1.ineqlin
pause
' ----------------- question 2 ----------------'
c2=[-11,-9];
[x2,f,exitf,out,lag2]=linprog(c2,A,b,[],[],v1);
z2=-f;
x2,z2,lag2.ineqlin
pause
'________________dual problem_________________'
v1D=[0 0 0];
[y,w,exitf,out,lagD]=linprog(b,-A',c,[],[],v1D);
y,w,lagD.ineqlin