有價(jià)證券數(shù)學(xué)建模競賽c題答-資料下載頁
2025-04-07 02:51本頁面
【正文】 7 對于模型3：第一種情形：LINGO程序如下：Max=*x1+*x2+*x3+*x4+*x5。x2+x3+x4=400。x1+x2+x3+x4+x5=1000。6*x1+6*x24*x34*x4+36*x5=0。4*x1+10*x2x32*x43*x5=0。X1=0。x2=0。x3=0。x4=0。x5=0。運(yùn)算結(jié)果：Rows= 5 Vars= 5 No. integer vars= 0 ( all are linear) Nonzeros= 25 Constraint nonz= 18( 9 are + 1) DensitZ= Smallest and largest elements in abs value= No. : 3 No. =: 0 No. : 1, Obj=MAX, GUBs = 1 Single cols= 0 Global optimal solution found at step: 6 Objective value: Variable Value Reduced Cost X1 X2 X3 X4 X5 Row Slack or Surplus Dual Price 1 2 3 4 5 第二種情形：LINGO程序如下：Max=*x1+*x2+*x3+*x4+*x5。x2+x3+x4=400。x1+x2+x3+x4+x5=1000。6*x1+6*x24*x34*x4+36*x5=0。4*x1+10*x2x32*x43*x5=0。X1=0。x2=0。x3=0。x4=0。x5=0。運(yùn)算結(jié)果：Rows= 5 Vars= 5 No. integer vars= 0 ( all are linear) Nonzeros= 25 Constraint nonz= 18( 9 are + 1) DensitZ= Smallest and largest elements in abs value= No. : 3 No. =: 0 No. : 1, Obj=MAX, GUBs = 1 Single cols= 0 Global optimal solution found at step: 8 Objective value: Variable Value Reduced Cost X1 X2 X3 X4 X5 Row Slack or Surplus Dual Price 1 2 3 4 5 13
數(shù)學(xué)相關(guān)推薦
鄂ICP備17016276號-1