Jsun Yui Wong
Based on the transformer design problem on pages 258-272 of Reference 1, the computer program below does not use the bounds on page 258 of Reference 1. It is similar to the computer program of the preceding post.
The present paper requires X(5) and X(6) to be continuous variables because these two variables represent magnetic-flux density and electric-current density, respectively; see Reference 1, page 258. Thus the following computer program has four integer variables and two continuous variables.
Line 94 and line 293 through line 298 below are different from line 94 and line 293 through line 298 of the preceding post.
0 REM DEFINT A-Z
1 REM DEFSNG L,S,P,M,R,Q
2 DEFSNG A-Z
3 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*100)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
182 JJ=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
185 IF RND<.5 THEN 188 ELSE 201
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 REM
193 REM
194 GOTO 351
201 X(J)=A(JJ)
202 X(JJ)=A(J)
209 GOTO 351
293 X(1)=INT(RND*100):GOTO 351
294 X(2)=INT(RND*100):GOTO 351
295 X(3)=INT(RND*100):GOTO 351
296 X(4)=INT(RND*100):GOTO 351
297 X(5)=RND*100:GOTO 351
298 X(6)=RND*100:GOTO 351
351 REM
352 FOR IXX=1 TO 4
353 X(IXX)=INT(X(IXX))
354 NEXT IXX
355 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
356 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-133 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. Only the top three among the candidate solutions produced are shown below. What immediately follows is a manual copy from the computer screen.
5 5 9 10 .92051
.9994869 -132.3585 -19884
5 4 8 10 .9984867
1.295721 -131.4733 -19706
4 4 10 11 .9869365
1.191705 -131.7271 -13951
Interpreted in accordance with line 1912, the solution at JJJJ=-19706 is the best among the solutions shown above. This complete run through JJJJ=32000 took four hours on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
« September 2010 | Main | November 2010 »
October 2010
10/24/2010
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to a Transformer Design Model with Integer Variables and Continuous Variables, Fourth Edition
Posted at 09:10 AM | Permalink | Comments (0)
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to a Transformer Design Model with Integer Variables and Continuous Variables, Third Edition
Jsun Yui Wong
Based on the transformer design problem on pages 258-272 of Reference 1, the computer program below does not use the bounds on page 258 of Reference 1. It is similar to the computer program of the preceding post.
The present paper requires X(5) and X(6) to be continuous variables because these two variables represent magnetic-flux density and electric-current density, respectively; see Reference 1, page 258. Thus the following computer program has four integer variables and two continuous variables.
Line 94 and line 293 through line 298 below are different from line 94 and line 293 through line 298 of the preceding post.
0 REM DEFINT A-Z
1 REM DEFSNG L,S,P,M,R,Q
2 DEFSNG A-Z
3 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*50)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
182 JJ=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
185 IF RND<.5 THEN 188 ELSE 201
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 REM
193 REM
194 GOTO 351
201 X(J)=A(JJ)
202 X(JJ)=A(J)
209 GOTO 351
293 X(1)=INT(RND*50):GOTO 351
294 X(2)=INT(RND*50):GOTO 351
295 X(3)=INT(RND*50):GOTO 351
296 X(4)=INT(RND*50):GOTO 351
297 X(5)=RND*50:GOTO 351
298 X(6)=RND*50:GOTO 351
351 REM
352 FOR IXX=1 TO 4
353 X(IXX)=INT(X(IXX))
354 NEXT IXX
355 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
356 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-133 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. Only the top three among the candidate solutions produced are shown below. What immediately follows is a manual copy from the computer screen.
5 4 9 12 .8476263
1.13062 -131.6207 220
5 5 9 9 .9736772
1.049861 -132.3907 12077
5 4 11 8 .999625
1.176586 -132.0274 26211
Interpreted in accordance with line 1912, the solution at JJJJ=220 is the best among the solutions shown above. This complete run through JJJJ=32000 took four hours on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
Posted at 04:48 AM | Permalink | Comments (0)
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to a Transformer Design Model with Integer Variables and Continuous Variables, Second Edition
Jsun Yui Wong
Based on the transformer design problem on pages 258-272 of Reference 1, the computer program below does not use the bounds on page 258 of Reference 1. It is similar to the computer program of the preceding post.
The present paper requires X(5) and X(6) to be continuous variables because these two variables represent magnetic-flux density and electric-current density, respectively; see Reference 1, page 258. Thus the following computer program has four integer variables and two continuous variables.
Line 94 and line 293 through line 298 below are different from line 94 and line 293 through line 298 of the preceding post.
0 REM DEFINT A-Z
1 REM DEFSNG L,S,P,M,R,Q
2 DEFSNG A-Z
3 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*40)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
182 JJ=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
185 IF RND<.5 THEN 188 ELSE 201
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 REM
193 REM
194 GOTO 351
201 X(J)=A(JJ)
202 X(JJ)=A(J)
209 GOTO 351
293 X(1)=INT(RND*40):GOTO 351
294 X(2)=INT(RND*40):GOTO 351
295 X(3)=INT(RND*40):GOTO 351
296 X(4)=INT(RND*40):GOTO 351
297 X(5)=RND*40:GOTO 351
298 X(6)=RND*40:GOTO 351
351 REM
352 FOR IXX=1 TO 4
353 X(IXX)=INT(X(IXX))
354 NEXT IXX
355 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
356 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-133 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. Only the top three among the candidate solutions produced are shown below. What immediately follows is a manual copy from the computer screen.
5 4 10 10 .9714081
1.065528 -131.9442 -26507
5 5 9 10 .9210182
.9989018 -132.3599 12963
5 4 11 9 .9970916
1.048514 -132.2288 -25514
Interpreted in accordance with line 1912, the solution at JJJJ=-26507 is the best among the solutions shown above. This complete run through JJJJ=32000 took four hours on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
Posted at 12:04 AM | Permalink | Comments (0)
10/23/2010
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to a Transformer Design Model with Integer Variables and Continuous Variables
Jsun Yui Wong
Based on the transformer design problem on pages 258-272 of Reference 1, the computer program below does not use the bounds on page 258 of Reference 1. It is similar to the computer program of the preceding post.
The present paper requires X(5) and X(6) to be continuous variables because these two variables represent magnetic-flux density and electric-current density, respectively; see Reference 1, page 258. Thus the following computer program has four integer variables and two continuous variables.
0 REM DEFINT A-Z
1 REM DEFSNG L,S,P,M,R,Q
2 DEFSNG A-Z
3 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*30)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
182 JJ=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
185 IF RND<.5 THEN 188 ELSE 201
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 REM
193 REM
194 GOTO 351
201 X(J)=A(JJ)
202 X(JJ)=A(J)
209 GOTO 351
293 X(1)=INT(RND*30):GOTO 351
294 X(2)=INT(RND*30):GOTO 351
295 X(3)=INT(RND*30):GOTO 351
296 X(4)=INT(RND*30):GOTO 351
297 X(5)=RND*30:GOTO 351
298 X(6)=RND*30:GOTO 351
351 REM
352 FOR IXX=1 TO 4
353 X(IXX)=INT(X(IXX))
354 NEXT IXX
355 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
356 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-133 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. Only the top three among the candidate solutions produced are shown below. What immediately follows is a manual copy from the computer screen.
5 4 11 8 .9967145
1.180045 -132.0475 -8186
4 4 10 11 .996312
1.180501 -131.6324 16837
5 4 10 10 .9548757
1.084024 -131.5867 30433
Interpreted in accordance with line 1912, the solution at JJJJ=30433 is the best among the solutions shown above. This complete run through JJJJ=32000 took four hours on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
Posted at 04:14 PM | Permalink | Comments (0)
10/21/2010
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to Transformer Design, Fourth Edition
Jsun Yui Wong
The following computer program tries to solve the transformer design problem on pages 258-272 of Reference 1.
Line 94 and lines 293 through 298 below are different from line 94 and lines 293 through 298 of the preceding post.
0 DEFSNG A-Z
1 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*100)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 X(J)=INT(X(J))
194 GOTO 351
293 X(1)=INT(RND*100):GOTO 351
294 X(2)=INT(RND*100):GOTO 351
295 X(3)=INT(RND*100):GOTO 351
296 X(4)=INT(RND*100):GOTO 351
297 X(5)=INT(RND*100):GOTO 351
298 X(6)=INT(RND*100):GOTO 351
351 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
352 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-135 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1917 REM PRINT M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. The complete output through JJJJ=32000 is shown below. What immediately follows is a manual copy from the computer screen.
4 4 13 10 1
1 -133.9285 10863
A complete run of the program through JJJJ=32000 took two hours and fifty-five minutes on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida, 33432, 1981.
Posted at 10:15 AM | Permalink | Comments (0)
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to Transformer Design, Third Edition
Jsun Yui Wong
The following computer program tries to solve the transformer design problem on pages 258-272 of Reference 1.
Line 94 and lines 293 through 298 below are different from line 94 and lines 293 through 298 of the preceding post.
0 DEFSNG A-Z
1 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*50)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 X(J)=INT(X(J))
194 GOTO 351
293 X(1)=INT(RND*50):GOTO 351
294 X(2)=INT(RND*50):GOTO 351
295 X(3)=INT(RND*50):GOTO 351
296 X(4)=INT(RND*50):GOTO 351
297 X(5)=INT(RND*50):GOTO 351
298 X(6)=INT(RND*50):GOTO 351
351 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
352 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-135 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1917 REM PRINT M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. The complete output through JJJJ=32000 is shown below. What immediately follows is a manual copy from the computer screen.
5 4 13 8 1
1 -133.9278 15999
A complete run of the program through JJJJ=32000 took two hours and fifty-five minutes on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida, 33432, 1981.
Posted at 06:40 AM | Permalink | Comments (0)
10/20/2010
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to Transformer Design, Second Edition
Jsun Yui Wong
The following computer program tries to solve the transformer design problem on pages 258-272 of Reference 1.
Line 94 and lines 293 through 298 below are different from line 94 and lines 293 through 298 of the preceding post.
0 DEFSNG A-Z
1 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*40)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 X(J)=INT(X(J))
194 GOTO 351
293 X(1)=INT(RND*40):GOTO 351
294 X(2)=INT(RND*40):GOTO 351
295 X(3)=INT(RND*40):GOTO 351
296 X(4)=INT(RND*40):GOTO 351
297 X(5)=INT(RND*40):GOTO 351
298 X(6)=INT(RND*40):GOTO 351
351 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
352 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-135 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1917 REM PRINT M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. The complete output through JJJJ=32000 is shown below. What immediately follows is a manual copy from the computer screen.
4 4 10 13 1
1 -134.0165 -6703
4 4 10 13 1
1 -134.0165 17774
Interpreted in accordance with line 1912, the output above was obtained in two hours and fifty-five minutes on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida, 33432, 1981.
Posted at 11:07 PM | Permalink | Comments (0)
A Nonlinear Integer/Discrete/Continuous Programming Solver Applied to Transformer Design
Jsun Yui Wong
The following computer program tries to solve the transformer design problem on pages 255-272 of Reference 1.
The present post is similar to the blog post with the title "Testing a Nonlinear Integer Programming Algorithm with a Transformer Design Model," Sixth Edition, posted elsewhere with the posting date July 28, 2010.
0 DEFSNG A-Z
1 DEFINT I,J,K
4 DIM X(42),A(42),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 FOR KK=1 TO 6
94 A(KK)=INT(RND*30)
95 NEXT KK
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 6
131 X(K)=A(K)
132 NEXT K
181 J=1+FIX(RND*6)
183 R=(1-RND*2)*A(J)
188 IF RND<.14 THEN 191 ELSE IF RND<.17 THEN 293 ELSE IF RND<.2 THEN 294 ELSE IF RND<.25 THEN 295 ELSE IF RND<.33 THEN 296 ELSE IF RND<.5 THEN 297 ELSE 298
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
192 X(J)=INT(X(J))
194 GOTO 351
293 X(1)=INT(RND*30):GOTO 351
294 X(2)=INT(RND*30):GOTO 351
295 X(3)=INT(RND*30):GOTO 351
296 X(4)=INT(RND*30):GOTO 351
297 X(5)=INT(RND*30):GOTO 351
298 X(6)=INT(RND*30):GOTO 351
351 L1=-.001*X(1)*X(2)*X(3)*X(4)*X(5)*X(6)+2.07
352 L2=.00062*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))+.00058*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))-1.2
511 IF L1>0 THEN L1=-1000000! ELSE L1=0
512 IF L2>0 THEN L2=-1000000! ELSE L2=0
1311 SS=L1+L2
1333 P1NEWMAY=-.0204*X(1)*X(4)*(X(1)+X(2)+X(3))-.0187*X(2)*X(3)*(X(1)+1.57*X(2)+X(4))-.0607*X(1)*X(4)*X(5)^2*(X(1)+X(2)+X(3))-.0437*X(2)*X(3)*X(6)^2*(X(1)+1.57*X(2)+X(4))+SS
1448 P=P1NEWMAY
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 6
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-135 THEN 1912 ELSE 1999
1912 PRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1917 REM PRINT M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. The complete output through JJJJ=32000 is shown below. What immediately follows is a manual copy from the computer screen.
5 4 13 8 1
1 -133.9278 -1555
4 5 8 13 1
1 -133.718 28930
Interpreted in accordance with line 1912, the output above was obtained in two hours and forty minutes on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter. The solution at JJJJ=28930 is better than the solution at JJJJ=-1555.
References
[1] Panos Y. Papalambros, Douglas J. Wilde. Principles of Optimal Design, Second Edition. Cambridge University Press, 2000.
[2] Microsoft Corp. BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida, 33432, 1981.
Posted at 06:51 PM | Permalink | Comments (0)
10/17/2010
A Nonlinear Integer/Discrete/Continuous Solver Applied to an Oil Production Problem with 25 Oil Wells and 5 Oil Platforms
Jsun Yui Wong
The following computer program tries to solve a location-allocation problem from Reference 1. The present application relates to oil-wells and oil-platforms. Rectangular distances are used in lines 1333-1357 below.
0 DEFSNG A-Z
3 DEFINT I,J,K
4 DIM X(155),A(155),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 A(11)=0:A(12)=0:A(13)=0:A(14)=0:A(15)=1: A(16)=0:A(17)=0:A(18)=0:A(19)=0:A(20)=1
92 A(21)=0:A(22)=0:A(23)=0:A(24)=0:A(25)=1: A(26)=0:A(27)=0:A(28)=0:A(29)=0:A(30)=1
93 A(31)=0:A(32)=0:A(33)=0:A(34)=0:A(35)=1: A(36)=0:A(37)=0:A(38)=0:A(39)=0:A(40)=1
94 A(41)=0:A(42)=0:A(43)=0:A(44)=0:A(45)=1: A(46)=0:A(47)=0:A(48)=0:A(49)=0:A(50)=1
95 A(51)=0:A(52)=0:A(53)=0:A(54)=0:A(55)=1: A(56)=0:A(57)=0:A(58)=0:A(59)=0:A(60)=1
96 A(61)=0:A(62)=0:A(63)=0:A(64)=0:A(65)=1: A(66)=0:A(67)=0:A(68)=0:A(69)=0:A(70)=1
97 A(71)=0:A(72)=0:A(73)=0:A(74)=0:A(75)=1: A(76)=0:A(77)=0:A(78)=0:A(79)=0:A(80)=1
98 A(81)=0:A(82)=0:A(83)=0:A(84)=0:A(85)=1: A(86)=0:A(87)=0:A(88)=0:A(89)=0:A(90)=1
99 A(91)=0:A(92)=0:A(93)=0:A(94)=0:A(95)=1: A(96)=0:A(97)=0:A(98)=0:A(99)=0:A(100)=1
100 A(101)=0:A(102)=0:A(103)=0:A(104)=0:A(105)=1: A(106)=0:A(107)=0:A(108)=0:A(109)=0:A(110)=1
101 A(111)=0:A(112)=0:A(113)=0:A(114)=0:A(115)=1: A(116)=0:A(117)=0:A(118)=0:A(119)=0:A(120)=1
102 A(121)=0:A(122)=0:A(123)=0:A(124)=0:A(125)=1: A(126)=0:A(127)=0:A(128)=0:A(129)=0:A(130)=1
103 A(131)=0:A(132)=0:A(133)=0:A(134)=0:A(135)=1
115 REM A(83)=0:A(84)=0:A(85)=1
116 A(7)=RND*100
117 A(8)=RND*100
118 A(9)=RND*100
119 A(10)=RND*100
120 A(1)=RND*100
121 A(2)=RND*100
122 A(3)=RND*100
123 A(4)=RND*100
124 A(5)=RND*100
125 A(6)=RND*100
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 135
131 X(K)=A(K)
132 NEXT K
141 IF RND<.5 THEN 181 ELSE 298
181 J=1+FIX(RND*10)
183 R=RND*3*(1-RND*2)*A(J)
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
198 GOTO 1333
298 IF RND<1/25 THEN 401 ELSE IF RND<1/24 THEN 411 ELSE IF RND<1/23 THEN 421 ELSE IF RND<1/22 THEN 431 ELSE IF RND<1/21 THEN 441 ELSE IF RND<1/20 THEN 451 ELSE IF RND<1/19 THEN 461 ELSE IF RND<1/18 THEN 471 ELSE IF RND<1/17 THEN 481 ELSE 299
299 IF RND<1/16 THEN 491 ELSE IF RND<1/15 THEN 501 ELSE IF RND<1/14 THEN 511 ELSE IF RND<1/13 THEN 521 ELSE IF RND<1/12 THEN 531 ELSE IF RND<1/11 THEN 541 ELSE IF RND<1/10 THEN 551 ELSE IF RND<1/9 THEN 561 ELSE IF RND<1/8 THEN 571 ELSE 300
300 IF RND<1/7 THEN 581 ELSE IF RND<1/6 THEN 591 ELSE IF RND<1/5 THEN 601 ELSE IF RND<1/4 THEN 611 ELSE IF RND<1/3 THEN 621 ELSE IF RND<1/2 THEN 631 ELSE 641
401 IF RND<.2 THEN X(11)=0:X(12)=0:X(13)=0:X(14)=0:X(15)=1 ELSE IF RND<.4 THEN X(11)=0:X(12)=0:X(13)=0:X(14)=1:X(15)=0 ELSE IF RND<.6 THEN X(11)=0:X(12)=0:X(13)=1:X(14)=0:X(15)=0 ELSE IF RND<.8 THEN X(11)=0:X(12)=1:X(13)=0:X(14)=0:X(15)=0 ELSE 405
403 GOTO 1333
405 X(11)=1:X(12)=0:X(13)=0:X(14)=0:X(15)=0
408 GOTO 1333
411 IF RND<.2 THEN X(16)=0:X(17)=0:X(18)=0:X(19)=0:X(20)=1 ELSE IF RND<.4 THEN X(16)=0:X(17)=0:X(18)=0:X(19)=1:X(20)=0 ELSE IF RND<.6 THEN X(16)=0:X(17)=0:X(18)=1:X(19)=0:X(20)=0 ELSE IF RND<.8 THEN X(16)=0:X(17)=1:X(18)=0:X(19)=0:X(20)=0 ELSE 415
413 GOTO 1333
415 X(16)=1:X(17)=0:X(18)=0:X(19)=0:X(20)=0
418 GOTO 1333
421 IF RND<.2 THEN X(21)=0:X(22)=0:X(23)=0:X(24)=0:X(25)=1 ELSE IF RND<.4 THEN X(21)=0:X(22)=0:X(23)=0:X(24)=1:X(25)=0 ELSE IF RND<.6 THEN X(21)=0:X(22)=0:X(23)=1:X(24)=0:X(25)=0 ELSE IF RND<.8 THEN X(21)=0:X(22)=1:X(23)=0:X(24)=0:X(25)=0 ELSE 425
423 GOTO 1333
425 X(21)=1:X(22)=0:X(23)=0:X(24)=0:X(25)=0
428 GOTO 1333
431 IF RND<.2 THEN X(26)=0:X(27)=0:X(28)=0:X(29)=0:X(30)=1 ELSE IF RND<.4 THEN X(26)=0:X(27)=0:X(28)=0:X(29)=1:X(30)=0 ELSE IF RND<.6 THEN X(26)=0:X(27)=0:X(28)=1:X(29)=0:X(30)=0 ELSE IF RND<.8 THEN X(26)=0:X(27)=1:X(28)=0:X(29)=0:X(30)=0 ELSE 435
433 GOTO 1333
435 X(26)=1:X(27)=0:X(28)=0:X(29)=0:X(30)=0
438 GOTO 1333
441 IF RND<.2 THEN X(31)=0:X(32)=0:X(33)=0:X(34)=0:X(35)=1 ELSE IF RND<.4 THEN X(31)=0:X(32)=0:X(33)=0:X(34)=1:X(35)=0 ELSE IF RND<.6 THEN X(31)=0:X(32)=0:X(33)=1:X(34)=0:X(35)=0 ELSE IF RND<.8 THEN X(31)=0:X(32)=1:X(33)=0:X(34)=0:X(35)=0 ELSE 445
443 GOTO 1333
445 X(31)=1:X(32)=0:X(33)=0:X(34)=0:X(35)=0
448 GOTO 1333
451 IF RND<.2 THEN X(36)=0:X(37)=0:X(38)=0:X(39)=0:X(40)=1 ELSE IF RND<.4 THEN X(36)=0:X(37)=0:X(38)=0:X(39)=1:X(40)=0 ELSE IF RND<.6 THEN X(36)=0:X(37)=0:X(38)=1:X(39)=0:X(40)=0 ELSE IF RND<.8 THEN X(36)=0:X(37)=1:X(38)=0:X(39)=0:X(40)=0 ELSE 455
453 GOTO 1333
455 X(36)=1:X(37)=0:X(38)=0:X(39)=0:X(40)=0
458 GOTO 1333
461 IF RND<.2 THEN X(41)=0:X(42)=0:X(43)=0:X(44)=0:X(45)=1 ELSE IF RND<.4 THEN X(41)=0:X(42)=0:X(43)=0:X(44)=1:X(45)=0 ELSE IF RND<.6 THEN X(41)=0:X(42)=0:X(43)=1:X(44)=0:X(45)=0 ELSE IF RND<.8 THEN X(41)=0:X(42)=1:X(43)=0:X(44)=0:X(45)=0 ELSE 465
463 GOTO 1333
465 X(41)=1:X(42)=0:X(43)=0:X(44)=0:X(45)=0
468 GOTO 1333
471 IF RND<.2 THEN X(46)=0:X(47)=0:X(48)=0:X(49)=0:X(50)=1 ELSE IF RND<.4 THEN X(46)=0:X(47)=0:X(48)=0:X(49)=1:X(50)=0 ELSE IF RND<.6 THEN X(46)=0:X(47)=0:X(48)=1:X(49)=0:X(50)=0 ELSE IF RND<.8 THEN X(46)=0:X(47)=1:X(48)=0:X(49)=0:X(50)=0 ELSE 475
473 GOTO 1333
475 X(46)=1:X(47)=0:X(48)=0:X(49)=0:X(50)=0
478 GOTO 1333
481 IF RND<.2 THEN X(51)=0:X(52)=0:X(53)=0:X(54)=0:X(55)=1 ELSE IF RND<.4 THEN X(51)=0:X(52)=0:X(53)=0:X(54)=1:X(55)=0 ELSE IF RND<.6 THEN X(51)=0:X(52)=0:X(53)=1:X(54)=0:X(55)=0 ELSE IF RND<.8 THEN X(51)=0:X(52)=1:X(53)=0:X(54)=0:X(55)=0 ELSE 485
483 GOTO 1333
485 X(51)=1:X(52)=0:X(53)=0:X(54)=0:X(55)=0
488 GOTO 1333
491 IF RND<.2 THEN X(56)=0:X(57)=0:X(58)=0:X(59)=0:X(60)=1 ELSE IF RND<.4 THEN X(56)=0:X(57)=0:X(58)=0:X(59)=1:X(60)=0 ELSE IF RND<.6 THEN X(56)=0:X(57)=0:X(58)=1:X(59)=0:X(60)=0 ELSE IF RND<.8 THEN X(56)=0:X(57)=1:X(58)=0:X(59)=0:X(60)=0 ELSE 495
493 GOTO 1333
495 X(56)=1:X(57)=0:X(58)=0:X(59)=0:X(60)=0
498 GOTO 1333
501 IF RND<.2 THEN X(61)=0:X(62)=0:X(63)=0:X(64)=0:X(65)=1 ELSE IF RND<.4 THEN X(61)=0:X(62)=0:X(63)=0:X(64)=1:X(65)=0 ELSE IF RND<.6 THEN X(61)=0:X(62)=0:X(63)=1:X(64)=0:X(65)=0 ELSE IF RND<.8 THEN X(61)=0:X(62)=1:X(63)=0:X(64)=0:X(65)=0 ELSE 505
503 GOTO 1333
505 X(61)=1:X(62)=0:X(63)=0:X(64)=0:X(65)=0
508 GOTO 1333
511 IF RND<.2 THEN X(66)=0:X(67)=0:X(68)=0:X(69)=0:X(70)=1 ELSE IF RND<.4 THEN X(66)=0:X(67)=0:X(68)=0:X(69)=1:X(70)=0 ELSE IF RND<.6 THEN X(66)=0:X(67)=0:X(68)=1:X(69)=0:X(70)=0 ELSE IF RND<.8 THEN X(66)=0:X(67)=1:X(68)=0:X(69)=0:X(70)=0 ELSE 515
513 GOTO 1333
515 X(66)=1:X(67)=0:X(68)=0:X(69)=0:X(70)=0
518 GOTO 1333
521 IF RND<.2 THEN X(71)=0:X(72)=0:X(73)=0:X(74)=0:X(75)=1 ELSE IF RND<.4 THEN X(71)=0:X(72)=0:X(73)=0:X(74)=1:X(75)=0 ELSE IF RND<.6 THEN X(71)=0:X(72)=0:X(73)=1:X(74)=0:X(75)=0 ELSE IF RND<.8 THEN X(71)=0:X(72)=1:X(73)=0:X(74)=0:X(75)=0 ELSE 525
523 GOTO 1333
525 X(71)=1:X(72)=0:X(73)=0:X(74)=0:X(75)=0
528 GOTO 1333
531 IF RND<.2 THEN X(76)=0:X(77)=0:X(78)=0:X(79)=0:X(80)=1 ELSE IF RND<.4 THEN X(76)=0:X(77)=0:X(78)=0:X(79)=1:X(80)=0 ELSE IF RND<.6 THEN X(76)=0:X(77)=0:X(78)=1:X(79)=0:X(80)=0 ELSE IF RND<.8 THEN X(76)=0:X(77)=1:X(78)=0:X(79)=0:X(80)=0 ELSE 535
533 GOTO 1333
535 X(76)=1:X(77)=0:X(78)=0:X(79)=0:X(80)=0
538 GOTO 1333
541 IF RND<.2 THEN X(81)=0:X(82)=0:X(83)=0:X(84)=0:X(85)=1 ELSE IF RND<.4 THEN X(81)=0:X(82)=0:X(83)=0:X(84)=1:X(85)=0 ELSE IF RND<.6 THEN X(81)=0:X(82)=0:X(83)=1:X(84)=0:X(85)=0 ELSE IF RND<.8 THEN X(81)=0:X(82)=1:X(83)=0:X(84)=0:X(85)=0 ELSE 545
543 GOTO 1333
545 X(81)=1:X(82)=0:X(83)=0:X(84)=0:X(85)=0
548 GOTO 1333
551 IF RND<.2 THEN X(86)=0:X(87)=0:X(88)=0:X(89)=0:X(90)=1 ELSE IF RND<.4 THEN X(86)=0:X(87)=0:X(88)=0:X(89)=1:X(90)=0 ELSE IF RND<.6 THEN X(86)=0:X(87)=0:X(88)=1:X(89)=0:X(90)=0 ELSE IF RND<.8 THEN X(86)=0:X(87)=1:X(88)=0:X(89)=0:X(90)=0 ELSE 555
553 GOTO 1333
555 X(86)=1:X(87)=0:X(88)=0:X(89)=0:X(90)=0
558 GOTO 1333
561 IF RND<.2 THEN X(91)=0:X(92)=0:X(93)=0:X(94)=0:X(95)=1 ELSE IF RND<.4 THEN X(91)=0:X(92)=0:X(93)=0:X(94)=1:X(95)=0 ELSE IF RND<.6 THEN X(91)=0:X(92)=0:X(93)=1:X(94)=0:X(95)=0 ELSE IF RND<.8 THEN X(91)=0:X(92)=1:X(93)=0:X(94)=0:X(95)=0 ELSE 565
563 GOTO 1333
565 X(91)=1:X(92)=0:X(93)=0:X(94)=0:X(95)=0
568 GOTO 1333
571 IF RND<.2 THEN X(96)=0:X(97)=0:X(98)=0:X(99)=0:X(100)=1 ELSE IF RND<.4 THEN X(96)=0:X(97)=0:X(98)=0:X(99)=1:X(100)=0 ELSE IF RND<.6 THEN X(96)=0:X(97)=0:X(98)=1:X(99)=0:X(100)=0 ELSE IF RND<.8 THEN X(96)=0:X(97)=1:X(98)=0:X(99)=0:X(100)=0 ELSE 575
573 GOTO 1333
575 X(96)=1:X(97)=0:X(98)=0:X(99)=0:X(100)=0
578 GOTO 1333
581 IF RND<.2 THEN X(101)=0:X(102)=0:X(103)=0:X(104)=0:X(105)=1 ELSE IF RND<.4 THEN X(101)=0:X(102)=0:X(103)=0:X(104)=1:X(105)=0 ELSE IF RND<.6 THEN X(101)=0:X(102)=0:X(103)=1:X(104)=0:X(105)=0 ELSE 585
583 GOTO 1333
585 IF RND<.5 THEN X(101)=0:X(102)=1:X(103)=0:X(104)=0:X(105)=0 ELSE X(101)=1:X(102)=0:X(103)=0:X(104)=0:X(105)=0
588 GOTO 1333
591 IF RND<.2 THEN X(106)=0:X(107)=0:X(108)=0:X(109)=0:X(110)=1 ELSE IF RND<.4 THEN X(106)=0:X(107)=0:X(108)=0:X(109)=1:X(110)=0 ELSE IF RND<.6 THEN X(106)=0:X(107)=0:X(108)=1:X(109)=0:X(110)=0 ELSE 595
593 GOTO 1333
595 IF RND<.5 THEN X(106)=0:X(107)=1:X(108)=0:X(109)=0:X(110)=0 ELSE X(106)=1:X(107)=0:X(108)=0:X(109)=0:X(110)=0
598 GOTO 1333
601 IF RND<.2 THEN X(111)=0:X(112)=0:X(113)=0:X(114)=0:X(115)=1 ELSE IF RND<.4 THEN X(111)=0:X(112)=0:X(113)=0:X(114)=1:X(115)=0 ELSE IF RND<.6 THEN X(111)=0:X(112)=0:X(113)=1:X(114)=0:X(115)=0 ELSE 605
603 GOTO 1333
605 IF RND<.5 THEN X(111)=0:X(112)=1:X(113)=0:X(114)=0:X(115)=0 ELSE X(111)=1:X(112)=0:X(113)=0:X(114)=0:X(115)=0
608 GOTO 1333
611 IF RND<.2 THEN X(116)=0:X(117)=0:X(118)=0:X(119)=0:X(120)=1 ELSE IF RND<.4 THEN X(116)=0:X(117)=0:X(118)=0:X(119)=1:X(120)=0 ELSE IF RND<.6 THEN X(116)=0:X(117)=0:X(118)=1:X(119)=0:X(120)=0 ELSE 615
613 GOTO 1333
615 IF RND<.5 THEN X(116)=0:X(117)=1:X(118)=0:X(119)=0:X(120)=0 ELSE X(116)=1:X(117)=0:X(118)=0:X(119)=0:X(120)=0
618 GOTO 1333
621 IF RND<.2 THEN X(121)=0:X(122)=0:X(123)=0:X(124)=0:X(125)=1 ELSE IF RND<.4 THEN X(121)=0:X(122)=0:X(123)=0:X(124)=1:X(125)=0 ELSE IF RND<.6 THEN X(121)=0:X(122)=0:X(123)=1:X(124)=0:X(125)=0 ELSE 625
623 GOTO 1333
625 IF RND<.5 THEN X(121)=0:X(122)=1:X(123)=0:X(124)=0:X(125)=0 ELSE X(121)=1:X(122)=0:X(123)=0:X(124)=0:X(125)=0
628 GOTO 1333
631 IF RND<.2 THEN X(126)=0:X(127)=0:X(128)=0:X(129)=0:X(130)=1 ELSE IF RND<.4 THEN X(126)=0:X(127)=0:X(128)=0:X(129)=1:X(130)=0 ELSE IF RND<.6 THEN X(126)=0:X(127)=0:X(128)=1:X(129)=0:X(130)=0 ELSE 635
633 GOTO 1333
635 IF RND<.5 THEN X(126)=0:X(127)=1:X(128)=0:X(129)=0:X(130)=0 ELSE X(126)=1:X(127)=0:X(128)=0:X(129)=0:X(130)=0
638 GOTO 1333
641 IF RND<.2 THEN X(131)=0:X(132)=0:X(133)=0:X(134)=0:X(135)=1 ELSE IF RND<.4 THEN X(131)=0:X(132)=0:X(133)=0:X(134)=1:X(135)=0 ELSE IF RND<.6 THEN X(131)=0:X(132)=0:X(133)=1:X(134)=0:X(135)=0 ELSE 645
643 GOTO 1333
645 IF RND<.5 THEN X(131)=0:X(132)=1:X(133)=0:X(134)=0:X(135)=0 ELSE X(131)=1:X(132)=0:X(133)=0:X(134)=0:X(135)=0
648 GOTO 1333
653 GOTO 1333
658 GOTO 1333
663 GOTO 1333
668 GOTO 1333
673 GOTO 1333
678 GOTO 1333
683 GOTO 1333
693 GOTO 1333
1333 PNEWMA1= -(ABS(22-X(1))+ABS(3-X(6)))*X(11)-(ABS(22-X(2))+ABS(3-X(7)))*X(12) -(ABS(22-X(3))+ABS(3-X(8)))*X(13) - (ABS(22-X(4))+ABS(3-X(9)))*X(14)-(ABS(22-X(5))+ABS(3-X(10)))*X(15)
1334 PNEWMA2= -(ABS(69-X(1))+ABS(44-X(6)))*X(16)-(ABS(69-X(2))+ABS(44-X(7)))*X(17) -(ABS(69-X(3))+ABS(44-X(8)))*X(18) - (ABS(69-X(4))+ABS(44-X(9)))*X(19)-(ABS(69-X(5))+ABS(44-X(10)))*X(20)
1335 PNEWMA3= -(ABS(44-X(1))+ABS(50-X(6)))*X(21)-(ABS(44-X(2))+ABS(50-X(7)))*X(22) -(ABS(44-X(3))+ABS(50-X(8)))*X(23) - (ABS(44-X(4))+ABS(50-X(9)))*X(24)-(ABS(44-X(5))+ABS(50-X(10)))*X(25)
1336 PNEWMA4= -(ABS(70-X(1))+ABS(12-X(6)))*X(26)-(ABS(70-X(2))+ABS(12-X(7)))*X(27) -(ABS(70-X(3))+ABS(12-X(8)))*X(28) - (ABS(70-X(4))+ABS(12-X(9)))*X(29)-(ABS(70-X(5))+ABS(12-X(10)))*X(30)
1337 PNEWMA5= -(ABS(97-X(1))+ABS(51-X(6)))*X(31)-(ABS(97-X(2))+ABS(51-X(7)))*X(32) -(ABS(97-X(3))+ABS(51-X(8)))*X(33) - (ABS(97-X(4))+ABS(51-X(9)))*X(34)-(ABS(97-X(5))+ABS(51-X(10)))*X(35)
1338 PNEWMA6= -(ABS(94-X(1))+ABS(35-X(6)))*X(36)-(ABS(94-X(2))+ABS(35-X(7)))*X(37) -(ABS(94-X(3))+ABS(35-X(8)))*X(38) - (ABS(94-X(4))+ABS(35-X(9)))*X(39)-(ABS(94-X(5))+ABS(35-X(10)))*X(40)
1339 PNEWMA7= -(ABS(100-X(1))+ABS(62-X(6)))*X(41)-(ABS(100-X(2))+ABS(62-X(7)))*X(42) -(ABS(100-X(3))+ABS(62-X(8)))*X(43) - (ABS(100-X(4))+ABS(62-X(9)))*X(44)-(ABS(100-X(5))+ABS(62-X(10)))*X(45)
1340 PNEWMA8= -(ABS(94-X(1))+ABS(26-X(6)))*X(46)-(ABS(94-X(2))+ABS(26-X(7)))*X(47) -(ABS(94-X(3))+ABS(26-X(8)))*X(48) - (ABS(94-X(4))+ABS(26-X(9)))*X(49)-(ABS(94-X(5))+ABS(26-X(10)))*X(50)
1341 PNEWMA9= -(ABS(13-X(1))+ABS(75-X(6)))*X(51)-(ABS(13-X(2))+ABS(75-X(7)))*X(52) -(ABS(13-X(3))+ABS(75-X(8)))*X(53) - (ABS(13-X(4))+ABS(75-X(9)))*X(54)-(ABS(13-X(5))+ABS(75-X(10)))*X(55)
1342 PNEWMA10= -(ABS(65-X(1))+ABS(99-X(6)))*X(56)-(ABS(65-X(2))+ABS(99-X(7)))*X(57) -(ABS(65-X(3))+ABS(99-X(8)))*X(58) - (ABS(65-X(4))+ABS(99-X(9)))*X(59)-(ABS(65-X(5))+ABS(99-X(10)))*X(60)
1343 PNEWMA11= -(ABS(58-X(1))+ABS(59-X(6)))*X(61)-(ABS(58-X(2))+ABS(59-X(7)))*X(62) -(ABS(58-X(3))+ABS(59-X(8)))*X(63) - (ABS(58-X(4))+ABS(59-X(9)))*X(64)-(ABS(58-X(5))+ABS(59-X(10)))*X(65)
1344 PNEWMA12= -(ABS(82-X(1))+ABS(31-X(6)))*X(66)-(ABS(82-X(2))+ABS(31-X(7)))*X(67) -(ABS(82-X(3))+ABS(31-X(8)))*X(68) - (ABS(82-X(4))+ABS(31-X(9)))*X(69)-(ABS(82-X(5))+ABS(31-X(10)))*X(70)
1345 PNEWMA13= -(ABS(13-X(1))+ABS(95-X(6)))*X(71)-(ABS(13-X(2))+ABS(95-X(7)))*X(72) -(ABS(13-X(3))+ABS(95-X(8)))*X(73) - (ABS(13-X(4))+ABS(95-X(9)))*X(74)-(ABS(13-X(5))+ABS(95-X(10)))*X(75)
1346 PNEWMA14= -(ABS(87-X(1))+ABS(29-X(6)))*X(76)-(ABS(87-X(2))+ABS(29-X(7)))*X(77) -(ABS(87-X(3))+ABS(29-X(8)))*X(78) - (ABS(87-X(4))+ABS(29-X(9)))*X(79)-(ABS(87-X(5))+ABS(29-X(10)))*X(80)
1347 PNEWMA15= -(ABS(41-X(1))+ABS(87-X(6)))*X(81)-(ABS(41-X(2))+ABS(87-X(7)))*X(82) -(ABS(41-X(3))+ABS(87-X(8)))*X(83) - (ABS(41-X(4))+ABS(87-X(9)))*X(84)-(ABS(41-X(5))+ABS(87-X(10)))*X(85)
1348 PNEWMA16= -(ABS(47-X(1))+ABS(94-X(6)))*X(86)-(ABS(47-X(2))+ABS(94-X(7)))*X(87) -(ABS(47-X(3))+ABS(94-X(8)))*X(88) - (ABS(47-X(4))+ABS(94-X(9)))*X(89)-(ABS(47-X(5))+ABS(94-X(10)))*X(90)
1349 PNEWMA17= -(ABS(15-X(1))+ABS(89-X(6)))*X(91)-(ABS(15-X(2))+ABS(89-X(7)))*X(92) -(ABS(15-X(3))+ABS(89-X(8)))*X(93) - (ABS(15-X(4))+ABS(89-X(9)))*X(94)-(ABS(15-X(5))+ABS(89-X(10)))*X(95)
1350 PNEWMA18= -(ABS(20-X(1))+ABS(85-X(6)))*X(96)-(ABS(20-X(2))+ABS(85-X(7)))*X(97) -(ABS(20-X(3))+ABS(85-X(8)))*X(98) - (ABS(20-X(4))+ABS(85-X(9)))*X(99)-(ABS(20-X(5))+ABS(85-X(10)))*X(100)
1351 PNEWMA19= -(ABS(31-X(1))+ABS(50-X(6)))*X(101)-(ABS(31-X(2))+ABS(50-X(7)))*X(102) -(ABS(31-X(3))+ABS(50-X(8)))*X(103) - (ABS(31-X(4))+ABS(50-X(9)))*X(104)-(ABS(31-X(5))+ABS(50-X(10)))*X(105)
1352 PNEWMA20= -(ABS(12-X(1))+ABS(99-X(6)))*X(106)-(ABS(12-X(2))+ABS(99-X(7)))*X(107) -(ABS(12-X(3))+ABS(99-X(8)))*X(108) - (ABS(12-X(4))+ABS(99-X(9)))*X(109)-(ABS(12-X(5))+ABS(99-X(10)))*X(110)
1353 PNEWMA21= -(ABS(86-X(1))+ABS(75-X(6)))*X(111)-(ABS(86-X(2))+ABS(75-X(7)))*X(112) -(ABS(86-X(3))+ABS(75-X(8)))*X(113) - (ABS(86-X(4))+ABS(75-X(9)))*X(114)-(ABS(86-X(5))+ABS(75-X(10)))*X(115)
1354 PNEWMA22= -(ABS(47-X(1))+ABS(98-X(6)))*X(116)-(ABS(47-X(2))+ABS(98-X(7)))*X(117) -(ABS(47-X(3))+ABS(98-X(8)))*X(118) - (ABS(47-X(4))+ABS(98-X(9)))*X(119)-(ABS(47-X(5))+ABS(98-X(10)))*X(120)
1355 PNEWMA23= -(ABS(0-X(1))+ABS(52-X(6)))*X(121)-(ABS(0-X(2))+ABS(52-X(7)))*X(122) -(ABS(0-X(3))+ABS(52-X(8)))*X(123) - (ABS(0-X(4))+ABS(52-X(9)))*X(124)-(ABS(0-X(5))+ABS(52-X(10)))*X(125)
1356 PNEWMA24= -(ABS(54-X(1))+ABS(92-X(6)))*X(126)-(ABS(54-X(2))+ABS(92-X(7)))*X(127) -(ABS(54-X(3))+ABS(92-X(8)))*X(128) - (ABS(54-X(4))+ABS(92-X(9)))*X(129)-(ABS(54-X(5))+ABS(92-X(10)))*X(130)
1357 PNEWMA25= -(ABS(90-X(1))+ABS(79-X(6)))*X(131)-(ABS(90-X(2))+ABS(79-X(7)))*X(132) -(ABS(90-X(3))+ABS(79-X(8)))*X(133) - (ABS(90-X(4))+ABS(79-X(9)))*X(134)-(ABS(90-X(5))+ABS(79-X(10)))*X(135)
1437 P1NEWONE= PNEWMA1+PNEWMA2+PNEWMA3+PNEWMA4+PNEWMA5
1438 P1NEWTWO= PNEWMA6+PNEWMA7+PNEWMA8+PNEWMA9+PNEWMA10
1439 P1NEWTHR= PNEWMA11+PNEWMA12+PNEWMA13+PNEWMA14+PNEWMA15
1440 P1NEWFOU= PNEWMA16+PNEWMA17+PNEWMA18+PNEWMA19+PNEWMA20
1441 P1NEWFIV= PNEWMA21+PNEWMA22+PNEWMA23+PNEWMA24+PNEWMA25
1448 P=+P1NEWONE+P1NEWTWO+P1NEWTHR+P1NEWFOU+P1NEWFIV
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 135
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-390.1 THEN 1912 ELSE 1999
1912 LPRINT A(1),A(2),A(3),A(4),A(5),A(6),A(7),A(8),A(9),A(10),M,JJJJ
1922 REM GOTO 1966
1941 LPRINT A(11),A(12),A(13),A(14),A(15)
1942 LPRINT A(16),A(17),A(18),A(19),A(20)
1943 LPRINT A(21),A(22),A(23),A(24),A(25)
1944 LPRINT A(26),A(27),A(28),A(29),A(30)
1945 LPRINT A(31),A(32),A(33),A(34),A(35)
1946 LPRINT A(36),A(37),A(38),A(39),A(40)
1947 LPRINT A(41),A(42),A(43),A(44),A(45)
1948 LPRINT A(46),A(47),A(48),A(49),A(50)
1949 LPRINT A(51),A(52),A(53),A(54),A(55)
1950 LPRINT A(56),A(57),A(58),A(59),A(60)
1951 LPRINT A(61),A(62),A(63),A(64),A(65)
1952 LPRINT A(66),A(67),A(68),A(69),A(70)
1953 LPRINT A(71),A(72),A(73),A(74),A(75)
1954 LPRINT A(76),A(77),A(78),A(79),A(80)
1955 LPRINT A(81),A(82),A(83),A(84),A(85)
1956 LPRINT A(86),A(87),A(88),A(89),A(90)
1957 LPRINT A(91),A(92),A(93),A(94),A(95)
1958 LPRINT A(96),A(97),A(98),A(99),A(100)
1959 LPRINT A(101),A(102),A(103),A(104),A(105)
1960 LPRINT A(106),A(107),A(108),A(109),A(110)
1961 LPRINT A(111),A(112),A(113),A(114),A(115)
1962 LPRINT A(116),A(117),A(118),A(119),A(120)
1963 LPRINT A(121),A(122),A(123),A(124),A(125)
1964 LPRINT A(126),A(127),A(128),A(129),A(130)
1965 LPRINT A(131),A(132),A(133),A(134),A(135)
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. Its best candidate solutions through JJJJ=-31976 are presented below. What immediately follows is a hand copy from the output on paper.
25.05549 13.00001 90 47.00004 82.00774
49.99995 88.99999 62.00004 94.00001 30.45121
-389.0002 -31989
10000
00001
10000
00001
00100
00001
00100
00001
01000
00010
00100
00001
01000
00001
00010
00010
01000
01000
10000
01000
00100
00010
10000
00010
00100
28.76071 47.00005 83.3211 90.00001 13
50.00005 93.99996 30.00958 62 89.00001
-389.0002 -31976
10000
00100
10000
00100
00010
00100
00010
00100
00001
01000
00010
00100
00001
00100
01000
01000
00001
00001
10000
00001
00010
01000
10000
01000
00010
Interpreted in accordance with line 1912 through line 1965, the output above was obtained in four minutes on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] B. K.-S. Cheung, A. Langevin and H. Delmaire, Coupling Genetic Algorithm with a Grid Search Method To Solve Mixed Integer Nonlinear Programming Problems, Computers Math. Applic. Vol. 34, No. 12, pp.13-23, 1997.
[2] Microsoft Corp. BASIC, second edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
Posted at 03:32 PM | Permalink | Comments (0)
10/15/2010
A Nonlinear Integer/Discrete/Continuous Solver Applied to a Wells-Platforms Problem, Second Edition
Jsun Yui Wong
The following computer program tries to solve a location-allocation problem from Reference 1. Rectangular distances are used in lines 1333-1357 below.
The earlier edition can be found at wordpress.com.
0 DEFSNG A-Z
3 DEFINT I,J,K
4 DIM X(99),A(99),L(33),K(33)
75 FOR JJJJ=-32000 TO 32000
84 RANDOMIZE JJJJ
87 M=-1.7E+38
91 A(11)=0:A(12)=0:A(13)=1
92 A(14)=0:A(15)=0:A(16)=1
93 A(17)=0:A(18)=0:A(19)=1
94 A(20)=0:A(21)=0:A(22)=1
95 A(23)=0:A(24)=0:A(25)=1
96 A(26)=0:A(27)=0:A(28)=1
97 A(29)=0:A(30)=0:A(31)=1
98 A(32)=0:A(33)=0:A(34)=1
99 A(35)=0:A(36)=0:A(37)=1
100 A(38)=0:A(39)=0:A(40)=1
101 A(41)=0:A(42)=0:A(43)=1
102 A(44)=0:A(45)=0:A(46)=1
103 A(47)=0:A(48)=0:A(49)=1
104 A(50)=0:A(51)=0:A(52)=1
105 A(53)=0:A(54)=0:A(55)=1
106 A(56)=0:A(57)=0:A(58)=1
107 A(59)=0:A(60)=0:A(61)=1
108 A(62)=0:A(63)=0:A(64)=1
109 A(65)=0:A(66)=0:A(67)=1
110 A(68)=0:A(69)=0:A(70)=1
111 A(71)=0:A(72)=0:A(73)=1
112 A(74)=0:A(75)=0:A(76)=1
113 A(77)=0:A(78)=0:A(79)=1
114 A(80)=0:A(81)=0:A(82)=1
115 A(83)=0:A(84)=0:A(85)=1
116 REM A(6)=RND*100
120 A(1)=RND*100
121 A(2)=RND*100
122 A(3)=RND*100
123 A(4)=RND*100
124 A(5)=RND*100
125 A(6)=RND*100
126 REM IMAR=10+FIX(RND*32700)
128 FOR I=1 TO 3270
129 FOR K=1 TO 85
131 X(K)=A(K)
132 NEXT K
141 IF RND<.5 THEN 181 ELSE 298
181 J=1+FIX(RND*6)
183 R=RND*3*(1-RND*2)*A(J)
191 IF RND<.14 THEN X(J)=A(J)+RND^5*R ELSE IF RND<.17 THEN X(J)=A(J)+R ELSE IF RND<.2 THEN X(J)=A(J)+RND*R ELSE IF RND<.25 THEN X(J)=A(J)+RND^2*R ELSE IF RND<.33 THEN X(J)=A(J)+RND^3*R ELSE IF RND<.5 THEN X(J)=A(J)+RND^4*R ELSE X(J)=A(J)+RND^6*R
198 GOTO 1333
298 IF RND<1/25 THEN 301 ELSE IF RND<1/24 THEN 303 ELSE IF RND<1/23 THEN 305 ELSE IF RND<1/22 THEN 307 ELSE IF RND<1/21 THEN 309 ELSE IF RND<1/20 THEN 311 ELSE IF RND<1/19 THEN 313 ELSE IF RND<1/18 THEN 315 ELSE IF RND<1/17 THEN 317 ELSE 299
299 IF RND<1/16 THEN 319 ELSE IF RND<1/15 THEN 321 ELSE IF RND<1/14 THEN 323 ELSE IF RND<1/13 THEN 325 ELSE IF RND<1/12 THEN 327 ELSE IF RND<1/11 THEN 329 ELSE IF RND<1/10 THEN 331 ELSE IF RND<1/9 THEN 333 ELSE IF RND<1/8 THEN 335 ELSE 300
300 IF RND<1/7 THEN 337 ELSE IF RND<1/6 THEN 339 ELSE IF RND<1/5 THEN 341 ELSE IF RND<1/4 THEN 343 ELSE IF RND<1/3 THEN 345 ELSE IF RND<1/2 THEN 347 ELSE 349
301 IF RND<.333 THEN X(11)=0:X(12)=0:X(13)=1 ELSE IF RND<.666 THEN X(11)=0:X(12)=1:X(13)=0 ELSE X(11)=1:X(12)=0:X(13)=0
302 GOTO 1333
303 IF RND<.333 THEN X(14)=0:X(15)=0:X(16)=1 ELSE IF RND<.666 THEN X(14)=0:X(15)=1:X(16)=0 ELSE X(14)=1:X(15)=0:X(16)=0
304 GOTO 1333
305 IF RND<.333 THEN X(17)=0:X(18)=0:X(19)=1 ELSE IF RND<.666 THEN X(17)=0:X(18)=1:X(19)=0 ELSE X(17)=1:X(18)=0:X(19)=0
306 GOTO 1333
307 IF RND<.333 THEN X(20)=0:X(21)=0:X(22)=1 ELSE IF RND<.666 THEN X(20)=0:X(21)=1:X(22)=0 ELSE X(20)=1:X(21)=0:X(22)=0
308 GOTO 1333
309 IF RND<.333 THEN X(23)=0:X(24)=0:X(25)=1 ELSE IF RND<.666 THEN X(23)=0:X(24)=1:X(25)=0 ELSE X(23)=1:X(24)=0:X(25)=0
310 GOTO 1333
311 IF RND<.333 THEN X(26)=0:X(27)=0:X(28)=1 ELSE IF RND<.666 THEN X(26)=0:X(27)=1:X(28)=0 ELSE X(26)=1:X(27)=0:X(28)=0
312 GOTO 1333
313 IF RND<.333 THEN X(29)=0:X(30)=0:X(31)=1 ELSE IF RND<.666 THEN X(29)=0:X(30)=1:X(31)=0 ELSE X(29)=1:X(30)=0:X(31)=0
314 GOTO 1333
315 IF RND<.333 THEN X(32)=0:X(33)=0:X(34)=1 ELSE IF RND<.666 THEN X(32)=0:X(33)=1:X(34)=0 ELSE X(32)=1:X(33)=0:X(34)=0
316 GOTO 1333
317 IF RND<.333 THEN X(35)=0:X(36)=0:X(37)=1 ELSE IF RND<.666 THEN X(35)=0:X(36)=1:X(37)=0 ELSE X(35)=1:X(36)=0:X(37)=0
318 GOTO 1333
319 IF RND<.333 THEN X(38)=0:X(39)=0:X(40)=1 ELSE IF RND<.666 THEN X(38)=0:X(39)=1:X(40)=0 ELSE X(38)=1:X(39)=0:X(40)=0
320 GOTO 1333
321 IF RND<.333 THEN X(41)=0:X(42)=0:X(43)=1 ELSE IF RND<.666 THEN X(41)=0:X(42)=1:X(43)=0 ELSE X(41)=1:X(42)=0:X(43)=0
322 GOTO 1333
323 IF RND<.333 THEN X(44)=0:X(45)=0:X(46)=1 ELSE IF RND<.666 THEN X(44)=0:X(45)=1:X(46)=0 ELSE X(44)=1:X(45)=0:X(46)=0
324 GOTO 1333
325 IF RND<.333 THEN X(47)=0:X(48)=0:X(49)=1 ELSE IF RND<.666 THEN X(47)=0:X(48)=1:X(49)=0 ELSE X(47)=1:X(48)=0:X(49)=0
326 GOTO 1333
327 IF RND<.333 THEN X(50)=0:X(51)=0:X(52)=1 ELSE IF RND<.666 THEN X(50)=0:X(51)=1:X(52)=0 ELSE X(50)=1:X(51)=0:X(52)=0
328 GOTO 1333
329 IF RND<.333 THEN X(53)=0:X(54)=0:X(55)=1 ELSE IF RND<.666 THEN X(53)=0:X(54)=1:X(55)=0 ELSE X(53)=1:X(54)=0:X(55)=0
330 GOTO 1333
331 IF RND<.333 THEN X(56)=0:X(57)=0:X(58)=1 ELSE IF RND<.666 THEN X(56)=0:X(57)=1:X(58)=0 ELSE X(56)=1:X(57)=0:X(58)=0
332 GOTO 1333
333 IF RND<.333 THEN X(59)=0:X(60)=0:X(61)=1 ELSE IF RND<.666 THEN X(59)=0:X(60)=1:X(61)=0 ELSE X(59)=1:X(60)=0:X(61)=0
334 GOTO 1333
335 IF RND<.333 THEN X(62)=0:X(63)=0:X(64)=1 ELSE IF RND<.666 THEN X(62)=0:X(63)=1:X(64)=0 ELSE X(62)=1:X(63)=0:X(64)=0
336 GOTO 1333
337 IF RND<.333 THEN X(65)=0:X(66)=0:X(67)=1 ELSE IF RND<.666 THEN X(65)=0:X(66)=1:X(67)=0 ELSE X(65)=1:X(66)=0:X(67)=0
338 GOTO 1333
339 IF RND<.333 THEN X(68)=0:X(69)=0:X(70)=1 ELSE IF RND<.666 THEN X(68)=0:X(69)=1:X(70)=0 ELSE X(68)=1:X(69)=0:X(70)=0
340 GOTO 1333
341 IF RND<.333 THEN X(71)=0:X(72)=0:X(73)=1 ELSE IF RND<.666 THEN X(71)=0:X(72)=1:X(73)=0 ELSE X(71)=1:X(72)=0:X(73)=0
342 GOTO 1333
343 IF RND<.333 THEN X(74)=0:X(75)=0:X(76)=1 ELSE IF RND<.666 THEN X(74)=0:X(75)=1:X(76)=0 ELSE X(74)=1:X(75)=0:X(76)=0
344 GOTO 1333
345 IF RND<.333 THEN X(77)=0:X(78)=0:X(79)=1 ELSE IF RND<.666 THEN X(77)=0:X(78)=1:X(79)=0 ELSE X(77)=1:X(78)=0:X(79)=0
346 GOTO 1333
347 IF RND<.333 THEN X(80)=0:X(81)=0:X(82)=1 ELSE IF RND<.666 THEN X(80)=0:X(81)=1:X(82)=0 ELSE X(80)=1:X(81)=0:X(82)=0
348 GOTO 1333
349 IF RND<.333 THEN X(83)=0:X(84)=0:X(85)=1 ELSE IF RND<.666 THEN X(83)=0:X(84)=1:X(85)=0 ELSE X(83)=1:X(84)=0:X(85)=0
350 GOTO 1333
1333 PNEWMA1= -(ABS(22-X(1))+ABS(3-X(4)))*X(11)-(ABS(22-X(2))+ABS(3-X(5)))*X(12) -(ABS(22-X(3))+ABS(3-X(6)))*X(13)
1334 PNEWMA2= -(ABS(69-X(1))+ABS(44-X(4)))*X(14)-(ABS(69-X(2))+ABS(44-X(5)))*X(15) -(ABS(69-X(3))+ABS(44-X(6)))*X(16)
1335 PNEWMA3= -(ABS(44-X(1))+ABS(50-X(4)))*X(17)-(ABS(44-X(2))+ABS(50-X(5)))*X(18) -(ABS(44-X(3))+ABS(50-X(6)))*X(19)
1336 PNEWMA4= -(ABS(70-X(1))+ABS(12-X(4)))*X(20)-(ABS(70-X(2))+ABS(12-X(5)))*X(21) -(ABS(70-X(3))+ABS(12-X(6)))*X(22)
1337 PNEWMA5= -(ABS(97-X(1))+ABS(51-X(4)))*X(23)-(ABS(97-X(2))+ABS(51-X(5)))*X(24) -(ABS(97-X(3))+ABS(51-X(6)))*X(25)
1338 PNEWMA6= -(ABS(94-X(1))+ABS(35-X(4)))*X(26)-(ABS(94-X(2))+ABS(35-X(5)))*X(27) -(ABS(94-X(3))+ABS(35-X(6)))*X(28)
1339 PNEWMA7= -(ABS(100-X(1))+ABS(62-X(4)))*X(29)-(ABS(100-X(2))+ABS(62-X(5)))*X(30) -(ABS(100-X(3))+ABS(62-X(6)))*X(31)
1340 PNEWMA8= -(ABS(94-X(1))+ABS(26-X(4)))*X(32)-(ABS(94-X(2))+ABS(26-X(5)))*X(33) -(ABS(94-X(3))+ABS(26-X(6)))*X(34)
1341 PNEWMA9= -(ABS(13-X(1))+ABS(75-X(4)))*X(35)-(ABS(13-X(2))+ABS(75-X(5)))*X(36) -(ABS(13-X(3))+ABS(75-X(6)))*X(37)
1342 PNEWMA10= -(ABS(65-X(1))+ABS(99-X(4)))*X(38)-(ABS(65-X(2))+ABS(99-X(5)))*X(39) -(ABS(65-X(3))+ABS(99-X(6)))*X(40)
1343 PNEWMA11= -(ABS(58-X(1))+ABS(59-X(4)))*X(41)-(ABS(58-X(2))+ABS(59-X(5)))*X(42) -(ABS(58-X(3))+ABS(59-X(6)))*X(43)
1344 PNEWMA12= -(ABS(82-X(1))+ABS(31-X(4)))*X(44)-(ABS(82-X(2))+ABS(31-X(5)))*X(45) -(ABS(82-X(3))+ABS(31-X(6)))*X(46)
1345 PNEWMA13= -(ABS(13-X(1))+ABS(95-X(4)))*X(47)-(ABS(13-X(2))+ABS(95-X(5)))*X(48) -(ABS(13-X(3))+ABS(95-X(6)))*X(49)
1346 PNEWMA14= -(ABS(87-X(1))+ABS(29-X(4)))*X(50)-(ABS(87-X(2))+ABS(29-X(5)))*X(51) -(ABS(87-X(3))+ABS(29-X(6)))*X(52)
1347 PNEWMA15= -(ABS(41-X(1))+ABS(87-X(4)))*X(53)-(ABS(41-X(2))+ABS(87-X(5)))*X(54) -(ABS(41-X(3))+ABS(87-X(6)))*X(55)
1348 PNEWMA16= -(ABS(47-X(1))+ABS(94-X(4)))*X(56)-(ABS(47-X(2))+ABS(94-X(5)))*X(57) -(ABS(47-X(3))+ABS(94-X(6)))*X(58)
1349 PNEWMA17= -(ABS(15-X(1))+ABS(89-X(4)))*X(59)-(ABS(15-X(2))+ABS(89-X(5)))*X(60) -(ABS(15-X(3))+ABS(89-X(6)))*X(61)
1350 PNEWMA18= -(ABS(20-X(1))+ABS(85-X(4)))*X(62)-(ABS(20-X(2))+ABS(85-X(5)))*X(63) -(ABS(20-X(3))+ABS(85-X(6)))*X(64)
1351 PNEWMA19= -(ABS(31-X(1))+ABS(50-X(4)))*X(65)-(ABS(31-X(2))+ABS(50-X(5)))*X(66) -(ABS(31-X(3))+ABS(50-X(6)))*X(67)
1352 PNEWMA20= -(ABS(12-X(1))+ABS(99-X(4)))*X(68)-(ABS(12-X(2))+ABS(99-X(5)))*X(69) -(ABS(12-X(3))+ABS(99-X(6)))*X(70)
1353 PNEWMA21= -(ABS(86-X(1))+ABS(75-X(4)))*X(71)-(ABS(86-X(2))+ABS(75-X(5)))*X(72) -(ABS(86-X(3))+ABS(75-X(6)))*X(73)
1354 PNEWMA22= -(ABS(47-X(1))+ABS(98-X(4)))*X(74)-(ABS(47-X(2))+ABS(98-X(5)))*X(75) -(ABS(47-X(3))+ABS(98-X(6)))*X(76)
1355 PNEWMA23= -(ABS(0-X(1))+ABS(52-X(4)))*X(77)-(ABS(0-X(2))+ABS(52-X(5)))*X(78) -(ABS(0-X(3))+ABS(52-X(6)))*X(79)
1356 PNEWMA24= -(ABS(54-X(1))+ABS(92-X(4)))*X(80)-(ABS(54-X(2))+ABS(92-X(5)))*X(81) -(ABS(54-X(3))+ABS(92-X(6)))*X(82)
1357 PNEWMA25= -(ABS(90-X(1))+ABS(79-X(4)))*X(83)-(ABS(90-X(2))+ABS(79-X(5)))*X(84) -(ABS(90-X(3))+ABS(79-X(6)))*X(85)
1437 P1NEWONE= PNEWMA1+PNEWMA2+PNEWMA3+PNEWMA4+PNEWMA5
1438 P1NEWTWO= PNEWMA6+PNEWMA7+PNEWMA8+PNEWMA9+PNEWMA10
1439 P1NEWTHR= PNEWMA11+PNEWMA12+PNEWMA13+PNEWMA14+PNEWMA15
1440 P1NEWFOU= PNEWMA16+PNEWMA17+PNEWMA18+PNEWMA19+PNEWMA20
1441 P1NEWFIV= PNEWMA21+PNEWMA22+PNEWMA23+PNEWMA24+PNEWMA25
1448 P=+P1NEWONE+P1NEWTWO+P1NEWTHR+P1NEWFOU+P1NEWFIV
1451 IF P<=M THEN 1670
1657 FOR KEW=1 TO 85
1658 A(KEW)=X(KEW)
1659 NEXT KEW
1661 M=P
1666 GOTO 128
1670 NEXT I
1890 IF M>-631 THEN 1912 ELSE 1999
1912 LPRINT A(1),A(2),A(3),A(4),A(5),A(6),M,JJJJ
1940 REM GOTO 1999
1941 LPRINT A(11),A(12),A(13)
1942 LPRINT A(14),A(15),A(16)
1943 LPRINT A(17),A(18),A(19)
1944 LPRINT A(20),A(21),A(22)
1945 LPRINT A(23),A(24),A(25)
1946 LPRINT A(26),A(27),A(28)
1947 LPRINT A(29),A(30),A(31)
1948 LPRINT A(32),A(33),A(34)
1949 LPRINT A(35),A(36),A(37)
1950 LPRINT A(38),A(39),A(40)
1951 LPRINT A(41),A(42),A(43)
1952 LPRINT A(44),A(45),A(46)
1953 LPRINT A(47),A(48),A(49)
1954 LPRINT A(50),A(51),A(52)
1955 LPRINT A(53),A(54),A(55)
1956 LPRINT A(56),A(57),A(58)
1957 LPRINT A(59),A(60),A(61)
1958 LPRINT A(62),A(63),A(64)
1959 LPRINT A(65),A(66),A(67)
1960 LPRINT A(68),A(69),A(70)
1961 LPRINT A(71),A(72),A(73)
1962 LPRINT A(74),A(75),A(76)
1963 LPRINT A(77),A(78),A(79)
1964 LPRINT A(80),A(81),A(82)
1965 LPRINT A(83),A(84),A(85),M,JJJJ
1999 NEXT JJJJ
The BASIC computer program above was run with Microsoft's GW BASIC 3.11 interpreter, which is not a compiler. Its output through JJJJ=-31972 is presented below. What immediately follows is a manual copy from the output on paper.
22.00002 40.99998 87 50 93.99996
43.99998 -630.0001 -31996
1 0 0
0 0 1
1 0 0
0 0 1
0 0 1
0 0 1
0 0 1
0 0 1
1 0 0
0 1 0
0 0 1
0 0 1
0 1 0
0 0 1
0 1 0
0 1 0
0 1 0
0 1 0
1 0 0
0 1 0
0 0 1
0 1 0
1 0 0
0 1 0
0 0 1 -630.0001 -31996
21.99998 41.00003 87.00001 50 94
44.00003 -630.0001 -31973
1 0 0
0 0 1
1 0 0
0 0 1
0 0 1
0 0 1
0 0 1
0 0 1
1 0 0
0 1 0
0 0 1
0 0 1
0 1 0
0 0 1
0 1 0
0 1 0
0 1 0
0 1 0
1 0 0
0 1 0
0 0 1
0 1 0
1 0 0
0 1 0
0 0 1 -630.0001 -31973
87.00002 22.00005 41.00005 43.99998 50.00003
93.99999 -630.0001 -31972
0 1 0
1 0 0
0 1 0
1 0 0
1 0 0
1 0 0
1 0 0
1 0 0
0 1 0
0 0 1
1 0 0
1 0 0
0 0 1
1 0 0
0 0 1
0 0 1
0 0 1
0 0 1
0 1 0
0 0 1
1 0 0
0 0 1
0 1 0
0 0 1
1 0 0 -630.0001 -31972
Interpreted in accordance with line 1912 through line 1965, the output above was obtained in two minutes and 10 seconds on a personal computer with an Intel 2.66 GHz. chip and the IBM basica/D interpreter.
References
[1] B. K.-S. Cheung, A. Langevin and H. Delmaire, Coupling Genetic Algorithm with a Grid Search Method To Solve Mixed Integer Nonlinear Programming Problems, Computers Math. Applic. Vol. 34, No. 12, pp.13-23, 1997.
[2] Microsoft Corp. BASIC, second edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
Posted at 05:24 PM | Permalink | Comments (0)
