python多目标线性规划_用Pulp求解线性规划python问题

本文展示了如何使用Python的Pulp库来解决一个多目标线性规划问题,具体涉及到从多个起点到多个终点的货物配送,确保每个目的地仅由一个来源供应,并最小化运输成本。通过实例代码解释了如何定义变量、目标函数和约束条件,并成功找到了最优解。
摘要由CSDN通过智能技术生成

Routes

所有可能的路线,而你只有

cost_to_send

为某些路线定义。

路线

Routes = [(i, j) for i in origin for j in destination if j in cost_to_send[i]]

我能看到的另一个问题是第二组约束:

for i in origin:

prob += lpSum(quantity[i][j] for j in destination) == 1

所有目的地必须只有一个来源,而不是所有来源

必须使用

from pulp import *

import pandas as pd

origin = ["a","b","c","d","e","f","g","h"]

destination = ["1","2","3","4","5","6","7","8","9","10"]

offer = {"a":3,"b":3,"c":3,"d":3,"e":3,"f":4,"g":3,"h":3}

demand = {"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"8":1,"9":1,&#

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值