灵敏性分析源代码

线性规划求解的单纯形法的灵敏度分析的编程实现

function [x,z,flg,sgma]=simplexfun(A,A1,b,c,m,n,n1,cb,xx)
% A,b are the matric in Ax=b
% c is the matrix in max z=cx
% A1 is the matric in simplex table
% m is the numbers of row in A and n is the con number in A
% n1 is the nubers of
artificial
variables,and
artificial
variables
are default
as the last
%
n1
variables in x.
% cb is the worth coefficient matrix for basic variables
% xx is the index matrix for basic variables
% B1 is the invers matrix for the basic matrix in simplex table.The initial
% matrix is default as the last m con in the matrix A.
x=zeros(n,1);
z=0;
B1=A1(:,n-m+1:n);
sgma1=c-(cb*B1)*A;
[masg,kk]=max(sgma1);
k=kk(1);
fl
g=0;
l
l
=0;
while (masg>0)&&(ll<20)
l
l
=ll+1
;
thita=1000+zeros(m,1);
for i=1
:
m
i
f A1
(i
,
k)>0
thita(i)=A1(i,k)\b(i);
end
end
[r8,c8]=find(thita>999);
i
f sum(c8)<m

公众号 yk 坤帝
免费 获取源代码

文章来源: blog.csdn.net，作者：yk 坤帝，版权归原作者所有，如需转载，请联系作者。

原文链接：blog.csdn.net/qq_45803923/article/details/122398988