利用Python的pulp库来解决线性规划问题。
题目:
代码:
from pulp import *
def getresult():
# 设置对象
prob = LpProblem('myPro', LpMaximize)
# 设置三个变量,并设置变量最小取值
x1 = LpVariable("x1", lowBound=0)
x2 = LpVariable("x2", lowBound=0)
x3 = LpVariable("x3", lowBound=0)
X = [x1, x2, x3]
# 目标函数
z = x1+x2+x3
prob += z
# 载入约束变量
prob += 23*x1+7*x2+16*x3 <= 1# 约束条件1
prob += 21*x1+18*x2+8*x3 <= 1
prob += x1+23*x2+21*x3 <= 1
print('确认线性规划是否输入正确:',prob)
# 求解
status = prob.solve()
print('\naim ending is ',value(prob.objective)) # 计算结果
for i in prob.variables():
print('\nanswer is ',i.varValue)
if __name__ == '__main__':
getresult()