00485 ø5800827e240b30f763697e2e2f9b46

491

An Algorithm and a Graphical Approach for Short Run Processes

(**keep best feasible solution **} if (abs(pen)<DDelta) and (bar>=0) then begin

if fk<fbest then

begin fbest:=fk;for i:=l to n do xbest[i]:=x[i];bestck:=ck; end; end;

until ok;

for i:=l to n do x[i]:=xbest[i]; {** return best solution **} end;

{MAIN PROGRAM}

BEGIN

N:=3; {*** no. of decision vars. ***} assign(fl ,'INPUT.pm'); reset(fl);

assign(tl ;OUTPUT.pm');REWRITE(Tl);

{**** Lower and Upper bounds for decsion variables ***♦}

LB[2]:=1.0; {** f>l At least one sample during T **}

LB[3]:=0.5; {**k>0.5**}

LB[4]:=1.0; UB[3]:=4.00; UB(2}:=MAXBOUND;UB(4]:=MAXBOUND;clrscr, write('Enter number ofrows in file INPUT.PRN ');readln(noexp);

FOR JJ:=1 TO noexp DO BEGIN

bestcost:=le50;for i:=l to 4 do best[i]:=0.0;INPUT_DATA;

for II:=I to 8 do {*** n from 1 to 8 ***}

begin

x03:=-0.5;

for kO:=l to 4 do {*** kO = 0.5,1.5,2.5,3 5 ***} begin

x03:=x03+1.0;

for ffl):=l to 6 do    1,9,17,25,33,41 ***}

begin case ffl) of

I:x02:=1.0;2:x02:=9.0;3:x02:=17.0;4:x02:=25.0;5:x02:=33.0;6:x02:=41.0;

end;

INITIALIZE;X[2]:=X02;X[3]:=X03;X[4]:=II;penalty_barrier(X);

ck:=bestck;fk:=Fun(x)-pen*ck-bar/ck;

if (abs(pen)<DDelta) and (bar>=0) then

begin

if fk<bestcost then

begin bestcost:=fk;for i:=l to 4 do best[i]:=x(i]; end; end;

write('n= ',11,' bestf= ’,bestcost:5:4); for i:=l to 4 do writeC x[',i,']= ',best[i]:5:2,' ^writeln; end; end; end;

PRINTSOLUTION;

END,

CLOSE(Fl);CLOSE(Tl);

END.