整数规划问题及其松驰问题的解的接近与界的关系

Neamess and Bound Relationships Between an Integer Programming Problem and Its Relaxed Linear Programming Problem

根据整数规划问题及其松驰线性规划问题的解的距离和界讨论者解之间的关系。应用已有的极点理论，优化相伴凸组合的界并改进整数规划问题的目标函数及变量的界。

We discuss relationships between the solution to a integer problem and the solution to its relaxed linear programming problem in terms of the distance that separates them and related bounds.Assuming knowledge of extreme points,we develop bounds for associated convex combinations and improve bounds on the integer programming problem's objective function and variables.