import cvxpy as cpimport numpy as npimport pandas as pdd1=pd.read_excel(“E:/新建 Microsoft Office Excel 工作表 (2).xlsx”,header=None)d2=d1.values; c=d2[:-1,:-1]d=d2[-1,:-1].reshape(1,-1); e=d2[:-1,-1].reshape(-1,1)x=cp.Variable((8,15))m=cp.Variable((8,15),integer=True)obj=cp.Minimize(cp.sum(cp.multiply(m,cp.multiply(c,x)))) #构造目标函数con=[cp.sum(cp.multiply(m,x),axis=1,keepdims=True)<=e,cp.sum(cp.multiply(m,x),axis=0,keepdims=True)==d, x>=1000,x<=2000, m>=0,m<=1] #构造约束条件prob=cp.Problem(obj,con) #构造模型prob.solve(solver=‘GLPK_MI’) #求解模型##print(“最优值为:”,prob.value)##print(“最优解为:\n”,x.value)
Python:这是个非线性规划的问题,有错误但我实在是不知道错在哪求大佬指点
最新推荐文章于 2024-01-04 14:22:37 发布