用lingo写代码maxz=1.15x4A+1.40 x2c +1.25 x3B +1.06 x5D (xiA,XiB,Xic,XiD ≥ 0( i = 1, 2, 3, 4, 5) X3B ≤ 40000 X2c ≤ 30000 s,ti -1.15x3A-1.06 x4D + X5D=0 -1.15x2a-1.06 xD +X4A + X4D=0 -1.15x1A-1.06 x2D+X3A+X3B+X3D=0 -1.06x1D+X2A+X2c+X2D=0(X1A+X1D=100000
时间: 2023-05-26 20:02:13 浏览: 52
)
maxz = 1.15*x4A + 1.40*x2c + 1.25*x3B + 1.06*x5D
subject to:
x1A + x1D = 100000
-1.15*x1A - 1.06*x2D + x3A + x3B + x3D = 0
-1.15*x2A - 1.06*x4D + x4A + x4D = 0
-1.15*x3A - 1.06*x4D + x5D + x3B + x3D = 0
-1.06*x1D + x2A + x2c + x2D = 0
x3B <= 40000
x2c <= 30000
x1A, x1D, x2A, x2c, x2D, x3A, x3B, x3D, x4A, x4D, x5D >= 0
相关问题
用lingo编maxz= 1.15x4A+1.40x2c+1.25x3в +1.06x5d 满足约束条件 X1A+X1D =100000 -1.06x1D+X2A+X2C+X2D =0 -1.15x1A-1.06 X2D +X3A +X3b +X3D =0 - 1.15x2A -1.06 X3D +X4A +X4D =0 -1.15x3A-1.06 x4D +X5D =0 X2c ≤30000 ≤40000 X3B xiA,XiB, xic, XiD ≥0 (i=1,2,3,4,5)
以下是满足约束条件的lingo代码:
```lingo
MIN = 1.15x1A + 1.4x2C + 1.25x3B + 1.06x4D + 1.06x5D
Subject to:
X1A * X1D = 100000 - 1.06x1D
X2A * X2C * X2D = 0 - 1.15x1A - 1.06X2D
X3A * X3B * X3D = 0 - 1.15x2A - 1.06X3D
X4A * X4D = 0 - 1.15x3A - 1.06x4D
X5D = 0
X2C <= 30000
X2C <= 40000
X1A, X1D, X2A, X2C, X2D, X3A, X3B, X3D, X4A, X4D, X5D >= 0
```
注:以上的代码依赖于当前给出的内容,在不同的上下文中,可能需要重新评估。
maxZ=I1+I2+I3+I4+I5+I6 I1+I2+I3+I4+I5+I6=5000; x1+x2+x3+x4+x5+x6>0 end用lingo求解
根据提供的引用内容,我们可以看出这是一道线性规划问题,可以使用lingo求解。下面是使用lingo求解的代码:
```
maxZ = I1 + I2 + I3 + I4 + I5 + I6
I1 + I2 + I3 + I4 + I5 + I6 = 5000
x1 + x2 + x3 + x4 + x5 + x6 > 0
Model:
maximize maxZ
I1 + I2 + I3 + I4 + I5 + I6 = 5000
x1 + x2 + x3 + x4 + x5 + x6 > 0
I1 <= 1000 * x1
I2 <= 1000 * x2
I3 <= 1000 * x3
I4 <= 1000 * x4
I5 <= 1000 * x5
I6 <= 1000 * x6
x1 <= 1
x2 <= 1
x3 <= 1
x4 <= 1
x5 <= 1
x6 <= 1
End
```