MAX2X1+8X2+6X3
SUBJECTTO
2)8X1+3X2+2X3<=250
3)2X1+X2<=50
4)4X1+3X3<=150
ENDLPOPTIMUM FOUND AT STEP 2
OBJVALUE=700.000000
MAX3X1+4X2+5X3+3X4+2X5
SUBJECTTO
2)2X1+3X2+4X3+5X4+X5<=11
3)3X1+4X2+2X3+X4+3X5<=16
4)7X1+2X2+5X3+4X4+2X5<=19
ENDLPOPTIMUM FOUND AT STEP 6
NEWINTEGER SOLUTION AT BRANCH 3 PIVOT 10
VARIABLE VALUE REDUCEDCOST
NO.ITERATIONS = 10
BRANCHES=3DETERM.=1.000E0
BESTREMAINING SOLUTION NO BETTER THAN 16.00000
ENUMERATIONCOMPLETE. BRANCHES=3 PIVOTS = 10
LASTINTEGER SOLUTION IS THE BEST FOUND
欢迎光临 大数据人|大数据第一社区 (http://www.bigdata.ren/) | Powered by Discuz! X3.2 |