问题描述:
对于01背包问题,简历数学模型,使用python的cplex模块解决问题,找到最大解。
代码实现:
# -*- coding: utf-8 -*-
# The MIP problem solved in this example is:
#(2,6),(2,3),(6,5),(5,4),(4,6),::(2,1),(3,3),(6,9),(5,7),(4,5),::(2,2),(2,4.5),(6,7.5),(5.5,4。5),(7.4,8.6)
# Maximize 6x1 + 3 x2 + 5 x3 + 4 x4 +6 x5+ x6 +3x7 + 9 x8+7 x9+5 x10+ 2 x11 +4.5 x12+7.5 x13 + 4.5x14 +8.6x15= 价值最大化
# Subject to
# (2,6),(2,3),(6,5),(5,4),(4,6),::(2,1),(3,3),(6,9),(5,7),(4,5),::(2,2),(2,4.5),(6,7.5),(5.5,4。5),(7.4,8.6) 重量小于背包的盛重量
# 2x1 + 2 x2 + 6 x3 + 5 x4 +4 x5+ 2 x6 +3x7 + 6 x8+7 x9+5 x10+ 2 x11 +2 x12+6 x13 + 5.5 x14 +7.4x15
# -x2+ x5<=0 2号背包必须在五号背包之前放入
# Bounds 对