LINGO軟件的求解一般線性模型例子

1、max+ 2x122x + 5x 121、用LINGO軟件求解線性規(guī)劃：s.t. J x + 2x2 0Min=x1*+2*x2;2*x1+5*x2=12;X1+2*x2=8;解： Global optimal solution found.Objective value:Infeasibilities:Total solver iterations:8.0000000.0000001VariableValueReduced CostX10.0000000.000000X24.0000000.000000RowSlack or SurplusDual Price18.0000001.00000

2、028.0000000.00000032 .用LINGO軟件求解： min z = 20 x+ 10 x5x1 + 4x 2 5、xx2 0解解：min=20*x1+10*x2;5*x1+4*x2=5;0.0000001.000000解Global optimal solution found.10.000000.0000001Objective value:Infeasibilities:Total solver iterations:VariableValueReduced CostX10.00000016.00000X21.0000000.000000RowSlack or Surplu

3、sDual Price110.00000-1.000000220.000000.00000030.000000-2.0000003、用LINGO軟件求解max z=100 x+ 180 x+r_1240 x+ 50 x+ 60 x1233x+ 6x+ 2x 600123x 130s.t. 1x 80270 x310000 x 3 0解：max=100*x1+180*x2+70*x3;40*x1+50*x2+60*x3=10000;3*x1+6*x2+2*x3=600;x1=130;x2=80;x3=200;解： Global optimal solution found.20003.850.0

4、00000Objective value:Infeasibilities:Total solver iterations:VariableValueReduced CostX1130.00000.000000X211.538460.000000X370.384620.000000RowSlack or SurplusDual Price120003.851.00000020.0000000.230769230.00000028.0769240.0000006.538462568.461540.0000004、假設(shè)現(xiàn)在一個(gè)計(jì)算機(jī)廠商要生產(chǎn)兩種型號(hào)的PC：標(biāo)準(zhǔn)型(standard)和增強(qiáng)型(tur

5、bo)，由 于生產(chǎn)線和勞動(dòng)力工作時(shí)間的約束，使得標(biāo)準(zhǔn)型PC最多生產(chǎn)100臺(tái)。增強(qiáng)型PC最多生產(chǎn) 120臺(tái)；一共耗時(shí)勞動(dòng)力時(shí)間不能超過160小時(shí)。已知每臺(tái)標(biāo)準(zhǔn)型PC可獲利潤(rùn)$100，耗掉 1小時(shí)勞動(dòng)力工作時(shí)間；每臺(tái)增強(qiáng)型PC可獲利潤(rùn)$150，耗掉2小時(shí)勞動(dòng)力工作時(shí)間。請(qǐng)問： 該如何規(guī)劃這兩種計(jì)算機(jī)的生產(chǎn)量才能夠使得最后獲利最大？max=100*x1+150*x2;x1+2*x2=160;x1=100;x2=1;0.8*x1+x2=1.6;x1=2;x2=1.4;Global optimal solution found.Objective value:Infeasibilities:Total solver iterations:10640.000.0000000VariableValueReduced CostX11.0000000.000000X20.80000000.000000RowSlack or SurplusDual Price1106