Nearness and Bound Relationships Between an Integer-Programming Problem and Its Relaxed Linear-Programming Problem

A. Joseph, S. I. Gass and N. A. Bryson
Additional contact information
A. Joseph: University of Miami
S. I. Gass: College of Business and Management, University of Maryland
N. A. Bryson: Howard University

Journal of Optimization Theory and Applications, 1998, vol. 98, issue 1, No 4, 55-63

Abstract: 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 (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1022632713397 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:98:y:1998:i:1:d:10.1023_a:1022632713397

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1022632713397

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().