数学建模算法（一）：线性规划

1.（DVD

式子

代码

MODEL:
SETS:
CN/C1..C1000/:B;
DN/D1..D100/:DVNUM;
LINKS(CN,DN):SATI,X;
ENDSETS
DATA:
SATI,DVNUM=@OLE('D:LINGODATA2005table2.xlsx');
@OLE('D:LINGODATA2005table2.xlsx','X','B')= X,B;
@TEXT()=@STATUS();
ENDDATA
SA=@SUM(LINKS(I,J):
@IF(SATI(I,J) #EQ# 0,0,1)*X(I,J)*(11-SATI(I,J)));
NUM=@SUM(CN(I):B(I));
MAX=SA;
@FOR(LINKS(I,J):@BIN(X(I,J)));
@FOR(CN(I):@BIN(B(I)));
@FOR(DN(J):@SUM(CN(I):X(I,J))<=DVNUM(J));
@FOR(CN(I):@SUM(DN(J):X(I,J))<=B(I)*3);

END

2.

MODEL:
SETS:
CN/C1..C1000/:A;
DN/D1..D100/:NUM;
LINKS(CN,DN):SATI,Y;

ENDSETS
DATA:
SATI=@OLE('D:LINGODATA2005table3.xlsx');
@OLE('D:LINGODATA2005table3.xlsx','Y','A','NUM')= Y,A,NUM;
ENDDATA
SA=@SUM(LINKS(I,J):
@IF(SATI(I,J)#EQ#0 ,0,1)*Y(I,J)*(11-SATI(I,J)));

MAX=SA;
@FOR(LINKS(I,J):@BIN(Y(I,J)));
@FOR(CN(I):@BIN(A(I)));
@SUM(CN(I):A(I))=950;
@FOR(CN(I):@SUM(DN(J):Y(I,J))=A(I)*3);
@FOR(DN(J):NUM=@SUM(CN(I):Y(I,J)));
END

 3.（2014D研究生

MODEL:
SETS:
ZN/Z1..Z23/:X;  ! 23种;
YN/Y1..Y20/:CONT,EAT,LIMIT;  ! 20种;
DN/D1..D16/;  !16区域;
PINKS(ZN,DN):PRI;
LINKS(ZN,YN):NUTR;
ENDSETS

DATA:
NUTR,PRI,CONT,LIMIT=@OLE('D:LINGODATAYAN2014E_3.xlsx');
N=15;
@OLE('D:LINGODATAYAN2014E_3.xlsx',X_15,EAT_15)= X,EAT;
ENDDATA

SA=@SUM(ZN(I):PRI(I,N)*X(I));
MIN=SA;
@FOR(YN(J):EAT(J)=@SUM( ZN(I):@IF(PRI(I,N)#EQ#100000,0,1)*NUTR(I,J)*X(I) ));
@FOR(YN(J):EAT(J) >= CONT(J) );
@FOR(YN(J):EAT(J) < LIMIT(J) );

END