Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem

A. Joseph, S. I. Gass, N. A. Bryson

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

We discuss relationships between the solution to an integer-programming problem and the solution to its relaxed linear-program-ming 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.

Original languageEnglish (US)
Pages (from-to)55-63
Number of pages9
JournalJournal of Optimization Theory and Applications
Volume98
Issue number1
DOIs
StatePublished - Jul 1998

Keywords

  • Extreme points
  • Integer programming
  • Relaxed linear-programming problems
  • Solution bounds

ASJC Scopus subject areas

  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem'. Together they form a unique fingerprint.

  • Cite this