from scipy import optimize as op
import numpy as np
c=np.array([500,550,630,1000,800,700,800,700,600,950,900,930,1000,960,840,650,600,700,1200,1040,980,860,880,780])
A=np.zeros((6,24),dtype=np.float64)
B=np.zeros((6,1),dtype=np.float64)
Aeq=np.array([[1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1],[1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0],[0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0],[0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0],[0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0],[0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1]])
使用scipy.optimize求解线性规划问题，详细分析了如何通过Python解决运输问题，达到目标函数的最大值284230元。在最优决策中，不同地块种植的小麦、玉米、蔬菜和水果的分配得到了明确的数值解。
最低0.47元/天 解锁文章
1658
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
