python数学建模导论1.5 整数规划与指派问题的求解

python数学建模导论1.5 整数规划与指派问题的求解 18:25

from scipy.optimize import linear_sum_assignment
import numpy as np

cost = np.array([[25, 29, 31, 42], [39, 38, 26, 20], [34, 27, 28, 40], [24, 42, 36, 23]])
row_ind, col_ind = linear_sum_assignment(cost)
print(row_ind)  # 开销矩阵对应的行索引
print(col_ind)  # 对应行索引的最优指派的列索引
print(cost[row_ind, col_ind])  # 提取每个行索引的最优指派列索引所在的元素，形成数组print(cost[row ind,col ind].sum())#数组求和
print(cost[row_ind,col_ind].sum)

optimize.linear_sum_assignment指派问题函数，详看链接文章：
https://blog.csdn.net/qq_51570094/article/details/124020861