tem.txt

很好运筹学的DEOPHI原代码.包括动态规划,原始单纯形法,对策论,决策论等

label 1;
label 2;
label 3;
label 4;
begin
  for i:=0 to n-1 do
    for j:=0 to n-1 do
      CC[i+1,j+1]:=StrToFloat(matrix[i,j].Text );
  for j:=1 to n-1 do
    IT[j]:=1;
  for k:=1 to n-1 do
    begin
      P:=108;
      K1:=k-1;
      j:=2;
      while j<N+1 do
        begin
          if k=1 then goto 1;
          for L:=1 to K1 do
            if j=round(J0[L]) then goto 2;
1:        if CC[i,j]-P>=0 then goto 2;
          P:=CC[i,j];
          J0[K]:=j;
2:        j:=j+1;
        end;
      J:=round(J0[K]-1);
      IK[K]:=IT[j];
      JK[K]:=J0[K];
      D[K]:=P;
      if K=N-1 then goto 4;
      J:=2;
      while j<N+1 do
        begin
          for L:=1 to K do
            if j=round(J0[L]) then goto 3;
          JJ:=round(J0[K]);
          if CC[JJ,J]-CC[1,J]>=0 then goto 3;
          CC[1,J]:=CC[JJ,J];
          IT[J-1]:=J0[K];
3:        J:=J+1;
        end;
    end;