Try relaxing the value of each bounded constraint one at a time, solve the modified problem, and see what happens to the optimalvalue of the objective function.
一次只尝试放松每个边界约束一个单位,解决修改后的问题,看一下目标函数的优化值发生了什么变化。
2
The first section says that the solution found is integer optimal, and that the value found for the objective function is 23, a minimum.
第一部分说明所找到的解决方案是整型优化的,为目标函数找到的最小值是23。
3
The optimalvalue of the relaxed objective function (the one that didn't consider the decision variables as integers) is also printed here.