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

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 - Jan 1 1998

Fingerprint

Integer programming
Integer Programming
Linear programming
Convex Combination
Extreme Points
Linear Program
Objective function
Subset
Relationships

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

Cite this

Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem. / Joseph, Anito; Gass, S. I.; Bryson, N. A.

In: Journal of Optimization Theory and Applications, Vol. 98, No. 1, 01.01.1998, p. 55-63.

Research output: Contribution to journalArticle

@article{06db3218c30d43fbab9820bfc8217822,
title = "Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem",
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.",
keywords = "Extreme points, Integer programming, Relaxed linear-programming problems, Solution bounds",
author = "Anito Joseph and Gass, {S. I.} and Bryson, {N. A.}",
year = "1998",
month = "1",
day = "1",
doi = "10.1023/A:1022632713397",
language = "English (US)",
volume = "98",
pages = "55--63",
journal = "Journal of Optimization Theory and Applications",
issn = "0022-3239",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

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

AU - Joseph, Anito

AU - Gass, S. I.

AU - Bryson, N. A.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

KW - Extreme points

KW - Integer programming

KW - Relaxed linear-programming problems

KW - Solution bounds

UR - http://www.scopus.com/inward/record.url?scp=0032387057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032387057&partnerID=8YFLogxK

U2 - 10.1023/A:1022632713397

DO - 10.1023/A:1022632713397

M3 - Article

AN - SCOPUS:0032387057

VL - 98

SP - 55

EP - 63

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

SN - 0022-3239

IS - 1

ER -