Реферат: Табличный симплекс-метод

i,j : integer;

Summa : real;

Simplex : real;

begin

SimplexVector[0]:=0;

for i:=1 to m do

SimplexVector[0]:=SimplexVector[0] + DigitOfBasisVector[i]*VectorA[i, 0];

for j:=1 to m+n do

begin

Summa:=0;

for i:=1 to m do Summa:=Summa + DigitOfBasisVector[i]*VectorA[i, j];

SimplexVector[j]:=Summa - TargetVector[j];

if abs(SimplexVector[j]) <= Epsilon then SimplexVector[j]:=0;

end;

end;

function GetEnterVector : integer; { поиск вводимого вектора }

var

i : integer;

Min : real;

begin

GetEnterVector:=1;

Min:=SimplexVector[1];

for i:=2 to m+n do

if Min > SimplexVector[i]

then

begin

GetEnterVector:=i;

Min:=SimplexVector[i];

end;