ISSN:
1573-2878
Keywords:
Integer programming
;
relaxed linear-programming problems
;
extreme points
;
solution bounds
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We discuss relationships between the solution to an integer-programming problem and the solution to its relaxed linear-programming problem in terms of the distance that separates them and related bounds. Assuming knowledge of a subset of extreme points, we develop bounds for associated convex combinations and show how improved bounds on the integer-programming problem's objective function and variables can be obtained.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1022632713397