最低成本公式和线性规划

870 FOR J = 1 to C2 880 FOR I = 1 to M 890 IF B（I）<> J THEN 920 900 PRINT J，A（I，C1） 910 I = M 920 NEXT I 930 NEXT J 940 PRINT" DUAL VARIABLES：" 950 PRINTVARIABLE，VALUE 960 IF L = 0 THEN 1000 970 FOR I = 1 to L 980 PRINT I，-Z * A（M2，N + I） 990 NEXT I 1000 PRINT目标功能的价值; - Z * A（M2，C1） 1010打印 1020 PRINT 1030 GOTO 3060 1040 P = - .00001 1050 FOR J = 1 to C2 1060 IF A（M3 ，J）> = P THEN 1090 1070 S = J 1080 P = A（M3，J） 1090 NEXT J 1100如果P = - 。 00001那么1450 1110 GOSUB 1140 1120 GOSUB 1220 1130 GOTO 1040 1140 Q = 1.E +38 1150 FOR I = 1 to M 1160如果A（I，S）< =。00001那么1200 1170 IF A（I，C1）/ A（I，S）> = Q THEN 1200 1180 R = I 1190 Q = A（I，C1）/ A （我，S） 1200下一页我 1210返回 1220如果Q = 1.E + 38那么1250 1230 GOSUB 1270 1240返回 1250打印然后解决方案无法解决。 1260 GOTO 3060 1270 P = A（R，S） 1280 FOR I = 1 to M2 1290 IF I = R THEN 1360 1300 FOR J = 1 TO C1 1310如果J = S那么1350 1320 A（I，J）= A（I，J）-A（我， S）* A（R，J）/ P 1330如果ABS（A（I，J））> =。00001那么1350 1340 A（我， J）= 0 1350下一个J 1360下一个我 1370对于J = 1到C1 1380 A（R，J）= A（R，J）/ P 1390下一个J 1400 FOR I = 1 to M2 1410 A（I，S）= 0 1420 NE XT I 1430 A（R，S）= 1 1440 B（R）= S 1450返回 3000 DATA 1,1,1,1,1 3010 DATA .9，.8，.95，.7，.3 3020 DATA .05， .05，.02，.3，.7 3030 DATA .05，.15，.03,0,0 3040 DATA 100,83,14,3 3050 DATA 6.13,7.12,5.85,4.57,3.96 3060 END http://mymc10.tripod.com/commonbasic.htm http://mymc10.tripod.com/somecommon/LINPROG.TXT(This is old standard BASIC code).10 CLS20 PRINT "LINEAR PROGRAMMING"30 PRINT40 DIM A(6,10),B(6)50 PRINT60 PRINT "TYPE ''1'' FOR MAXIMIXATION, OR ''-1'' FOR MINIMIZATION";70 INPUT Z80 Z=-Z90 PRINT "TYPE NUMBER OF CONSTRAINTS, NUMBER OF VARIABLES";100 INPUT M,N110 PRINT "NUMBER OF LESS THAN, EQUAL, GREATER CONSTRAINTS";120 INPUT L,E,G130 IF M=L+E+G THEN 160140 PRINT "DATA ON CONSTRAINTS INCONSISTENT. TRY AGAIN."150 GOTO 110160 C=N+M+G170 C1=C+1180 C2=N+L+G190 M1=M+1200 M2=M+2210 PRINT220 FOR I=1 TO M2230 FOR J=1 TO C1240 A(I,J)=0250 NEXT J260 NEXT I270 FOR I=1 TO M280 B(I)=0290 NEXT I300 FOR I=1 TO M310 FOR J=1 TO N320 READ A(I,J)330 IF I<=L THEN 350340 A(M1,J)=A(M1,J)-A(I,J)350 NEXT J360 IF I>L THEN 400370 B(I)=N+I380 A(I,N+1)=1390 GOTO 460400 B(I)=N+G+I410 A(I,J+G+I)=1420 IF I>L+E THEN 440430 GOTO 460440 A(I,N+I-E)=-1450 A(M1,N+I-E)=1460 NEXT I470 FOR I=1 TO M480 READ A(I,C1)490 NEXT I500 FOR J=1 TO N510 READ A(M2,J)520 A(M2,J)=Z*A(M2,J)530 NEXT J540 PRINT550 P1=1560 PRINT "YOUR VARIABLES ";P1;"THROUGH";N570 IF L=0 THEN 590580 PRINT "SLACK VARIABLES";N+1;"THROUGH";N+L590 IF G=0 THEN 610600 PRINT "SURPLUS VARIABLES";N+L+1;"THROUGH";C610 IF L=M THEN 790620 PRINT "ARTIFICIAL VARIABLES";C2+1;"THROUGH";C630 M3=M1640 GOSUB 1040650 PRINT660 FOR I1=1 TO M670 IF B(I1)<=C2 THEN 780680 IF A(I1,C1)<=.00001 THEN 710690 PRINT "THE PROBLEM HAS NO FEASIBLE SOLUTION."700 GOTO 3060710 FOR J1=1 TO C2720 IF ABS(A(I1,J1))<=.00001 THEN 770730 R=I1740 S=J1750 GOSUB 1270760 J1=C2770 NEXT J1780 NEXT I1790 P1=2800 PRINT810 M3=M2820 GOSUB 1040830 PRINT840 PRINT "ANWWERS:"850 PRINT "PRIMAL VARIABLES:"860 PRINT "VARIABLES","VALUE"870 FOR J=1 TO C2880 FOR I=1 TO M890 IF B(I)<>J THEN 920900 PRINT J,A(I,C1)910 I=M920 NEXT I930 NEXT J940 PRINT "DUAL VARIABLES:"950 PRINT "VARIABLE","VALUE"960 IF L=0 THEN 1000970 FOR I=1 TO L980 PRINT I,-Z*A(M2,N+I)990 NEXT I1000 PRINT "VALUE OF OBJECTIVE FUNCTION";-Z*A(M2,C1)1010 PRINT1020 PRINT1030 GOTO 30601040 P=-.000011050 FOR J=1 TO C21060 IF A(M3,J)>=P THEN 10901070 S=J1080 P=A(M3,J)1090 NEXT J1100 IF P=-.00001 THEN 14501110 GOSUB 11401120 GOSUB 12201130 GOTO 10401140 Q=1.E+381150 FOR I=1 TO M1160 IF A(I,S)<=.00001 THEN 12001170 IF A(I,C1)/A(I,S)>=Q THEN 12001180 R=I1190 Q=A(I,C1)/A(I,S)1200 NEXT I1210 RETURN1220 IF Q=1.E+38 THEN 12501230 GOSUB 12701240 RETURN1250 PRINT "THEN SOLUTION IS UNBOUNDED."1260 GOTO 30601270 P=A(R,S)1280 FOR I=1 TO M21290 IF I=R THEN 13601300 FOR J=1 TO C11310 IF J=S THEN 13501320 A(I,J)=A(I,J)-A(I,S)*A(R,J)/P1330 IF ABS(A(I,J))>=.00001 THEN 13501340 A(I,J)=01350 NEXT J1360 NEXT I1370 FOR J=1 TO C11380 A(R,J)=A(R,J)/P1390 NEXT J1400 FOR I=1 TO M21410 A(I,S)=01420 NEXT I1430 A(R,S)=11440 B(R)=S1450 RETURN3000 DATA 1,1,1,1,13010 DATA .9,.8,.95,.7,.33020 DATA .05,.05,.02,.3,.73030 DATA .05,.15,.03,0,03040 DATA 100,83,14,33050 DATA 6.13,7.12,5.85,4.57,3.963060 END http://mathworld.wolfram.com/LinearProgramming.html 这也可能有所帮助： - http://www.aspirin.com/index_en.html Andrew http://mathworld.wolfram.com/LinearProgramming.htmlThis may help, too:- http://www.aspirin.com/index_en.htmlAndrew http://mathworld.wolfram.com/LinearProgramming.html 这也可能有所帮助： - http://www.aspirin.com/index_en.html Andrewhttp://mathworld.wolfram.com/LinearProgramming.htmlThis may help, too:-http://www.aspirin.com/index_en.htmlAndrew 这篇关于最低成本公式和线性规划的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！ 上岸，阿里云！