我的代表不足以发表评论。
但是您是否看过这个:
https://groups.google.com/forum/#!topic/pulp-or-
discuss/p1N2fkVtYyM
提出问题:
"The problem is solved in less than 0.5 second.However setting it up with PULP takes more than 10 seconds. "
这似乎也是您报告的内容。解决方案是不使用+ =或sum(…)运算符,而是按照链接中的说明进行 *** 作:
yeah using the += operator with pulp is really slow, as is using sum() instead of lpSum()
因此,也许您一次将约束1添加到PuLP,而不是先构建约束列表,然后最后将约束添加到PuLP?
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)