|
|||||
|
|
Nearness and Bound Relationships Between an Integer-Programming Problem and Its Relaxed Linear-Programming Problem |
|
| Authors: | A Joseph S I Gass N A Bryson |
| Institution: | (1) Department of Management Science, University of Miami, Coral Gables, Florida;(2) College of Business and Management, University of Maryland, College Park, Maryland;(3) Department of Information Systems and Analysis, Howard University, Washington, DC |
| 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. |
| Keywords: | Integer programming relaxed linear-programming problems extreme points solution bounds |
| 本文献已被 SpringerLink 等数据库收录！ | |