#max z=0.9 1.4 1.9 0.45 0.95 1.45 -0.05 0.45 0.95 x1-9 import cvxpy as cp import numpy…
- User
#max z=0.9 1.4 1.9 0.45 0.95 1.45 -0.05 0.45 0.95 x1-9
import cvxpy as cp import numpy as np n=9 x=cp.Variable(n,integer =False)
A=np.array([[-0.4,-0.2,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0],[0.6,-0.2,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0],[0.6,0.8,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0],[0,0,-0.85,-0.6,0,1,0,0,0,0,0,1,0,0,0,0,0],[0,0,0.15,-0.6,0,0,1,0,0,0,0,0,1,0,0,0,0],[0,0,0.15,0.4,0,0,0,1,0,0,0,0,0,1,0,0,0],[0,0,0,0,-0.5,1,0,0,0,0,0,0,0,0,1,0,0],[0,0,0,0,-0.5,0,1,0,0,0,0,0,0,0,0,1,0],[0,0,0,0,0.5,0,0,1,0,0,0,0,0,0,0,0,1]]) B=np.array([0,0,0,0,0,2000,2500,1200,0,0,0,0,0,0,0,0,0]) c=np.array([0.9,1.4,1.9,0.45,0.95,1.45,-0.05,0.45,0.95])
prob = cp.Problem(cp.Minimize(c @ x), [A @ x <= B]) prob.solve(solver='GLPK_ML',verbose=True) print("Optimal solution:", x.value) print("Optimal value:", prob.value) 报错 Incompatible dimensions (9, 17) (9, 1),修正一下
- Assistant
import cvxpy as cp import numpy as np n=9 x=cp.Variable(n,integer =False)
A=np.array([[-0.4,-0.2,0,0,0,1,0,0,1],[0.6,-0.2,0,0,0,0,1,0,0],[0.6,0.8,0,0,0,0,0,1,0],[0,0,-0.85,-0.6,0,1,0,0,0],[0,0,0.15,-0.6,0,0,1,0,0],[0,0,0.15,0.4,0,0,0,1,0],[0,0,0,0,-0.5,1,0,0,0],[0,0,0,0,-0.5,0,1,0,0],[0,0,0,0,0.5,0,0,1,0],[0,0,0,0,0,0,0,0,1]]) B=np.array([0,0,0,0,0,2000,2500,1200,0,0]) c=np.array([0.9,1.4,1.9,0.45,0.95,1.45,-0.05,0.45,0.95])
prob = cp.Problem(cp.Minimize(c @ x), [A @ x <= B]) prob.solve(solver='GLPK_ML',verbose=True) print("Optimal solution:", x.value) print("Optimal value:", prob.value)
- User
None -inf这个答案错误,你再改正下代码
- Assistant
import cvxpy as cp import numpy as np
n = 9 x = cp.Variable(n, integer=False)
A = np.array([[-0.4, -0.2, 0, 0, 0, 1, 0, 0, 1], [0.6, -0.2, 0, 0, 0, 0, 1, 0, 0], [0.6, 0.8, 0, 0, 0, 0, 0, 1, 0], [0, 0, -0.85, -0.6, 0, 1, 0, 0, 0], [0, 0, 0.15, -0.6, 0, 0, 1, 0, 0], [0, 0, 0.15, 0.4, 0, 0, 0, 1, 0], [0, 0, 0, 0, -0.5, 1, 0, 0, 0], [0, 0, 0, 0, -0.5, 0, 1, 0, 0], [0, 0, 0, 0, 0.5, 0, 0, 1, 0], [0, 0, 0, 0, 0, 0, 0, 0, 1]]) B = np.array([0, 0, 0, 0, 0, 2000, 2500, 1200, 0, 0]) c = np.array([0.9, 1.4, 1.9, 0.45, 0.95, 1.45, -0.05, 0.45, 0.95])
prob = cp.Problem(cp.Maximize(c @ x), [A @ x <= B]) prob.solve(solver='GLPK_MI', verbose=True) print("Optimal solution:", x.value) print("Optimal value:", prob.value)