小编Ala*_*aux的帖子

纸浆能以最小的限度管理约束吗?

我想优化以下代码,但我收到如下错误,涉及约束中的第四行(我认为)。任何帮助将不胜感激,谢谢:

\n\n
 model += A[i] == min(P[i], C[i])\n    TypeError: \'<\' not supported between instances of \'int\' and \'LpVariable\'\n\n    P0 = [[1,0,4],[2,0,3],[4,6,2],[5,2,1],[1,0,0]]\nx = [2,3,0]\nxMax = [14,12,13]\nC = [122, 99,  158, 37, 44]\n\n\n# Instantiate our problem class\nmodel = pulp.LpProblem("Clem", pulp.LpMaximize)\n\n# Construct our decision variable lists\nx = pulp.LpVariable.dicts(\'pInstal\', (i for i in range(3)), lowBound = 0, cat = \'Continuous\')\ntx = pulp.LpVariable(\'tauxAutoconso\', 0)\nfor i in range(5):\nP = pulp.LpVariable.dicts(\'vectProduction\',(i for i in range(5)), lowBound = 0, cat = \'Continuous\')\nA = pulp.LpVariable.dicts(\'vectAutoConso\',(i for i in range(5)), …
Run Code Online (Sandbox Code Playgroud)

python linear-programming pulp

1
推荐指数
1
解决办法
920
查看次数

标签 统计

linear-programming ×1

pulp ×1

python ×1