Surrogate-RLT cuts for zero–one integer programs

Junsang Yuh, Youngho Lee

Research output: Contribution to journalArticle

Abstract

In this paper, we consider the class of 0–1 integer problems and develop an effective cutting plane algorithm that gives valid inequalities called surrogate-RLT cuts (SR cuts). Here we implement the surrogate constraint analysis along with the reformulation–linearization technique (RLT) to generate strong valid inequalities. In this approach, we construct a tighter linear relaxation by augmenting SR cuts to the problem. The level-(Formula presented.) SR closure of a 0–1 integer program is the polyhedron obtained by intersecting all the SR cuts obtained from RLT polyhedron formed over each set of (Formula presented.) variables with its initial formulation. We present an algorithm for approximately optimizing over the SR closure. Finally, we present the computational result of SR cuts for solving 0–1 integer programming problems of well-known benchmark instances from MIPLIB 3.0.

Original languageEnglish
JournalJournal of Global Optimization
DOIs
Publication statusAccepted/In press - 2015 Apr 3

Fingerprint

Integer Program
Valid Inequalities
Integer programming
Polyhedron
Closure
Surrogate Constraints
0-1 Integer Programming
Cutting Plane Algorithm
Linear Relaxation
Computational Results
Benchmark
Integer
Integer program
Formulation
Valid inequalities

Keywords

  • Cutting plane
  • Integer programming
  • Partial convexification cuts
  • Reformulation–linearization technique
  • Surrogate constraint analysis
  • Surrogate-RLT cuts

ASJC Scopus subject areas

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

Cite this

Surrogate-RLT cuts for zero–one integer programs. / Yuh, Junsang; Lee, Youngho.

In: Journal of Global Optimization, 03.04.2015.

Research output: Contribution to journalArticle

@article{6c485fd8fdfd4373a7c7b65aeb1d1c8a,
title = "Surrogate-RLT cuts for zero–one integer programs",
abstract = "In this paper, we consider the class of 0–1 integer problems and develop an effective cutting plane algorithm that gives valid inequalities called surrogate-RLT cuts (SR cuts). Here we implement the surrogate constraint analysis along with the reformulation–linearization technique (RLT) to generate strong valid inequalities. In this approach, we construct a tighter linear relaxation by augmenting SR cuts to the problem. The level-(Formula presented.) SR closure of a 0–1 integer program is the polyhedron obtained by intersecting all the SR cuts obtained from RLT polyhedron formed over each set of (Formula presented.) variables with its initial formulation. We present an algorithm for approximately optimizing over the SR closure. Finally, we present the computational result of SR cuts for solving 0–1 integer programming problems of well-known benchmark instances from MIPLIB 3.0.",
keywords = "Cutting plane, Integer programming, Partial convexification cuts, Reformulation–linearization technique, Surrogate constraint analysis, Surrogate-RLT cuts",
author = "Junsang Yuh and Youngho Lee",
year = "2015",
month = "4",
day = "3",
doi = "10.1007/s10898-015-0297-0",
language = "English",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Surrogate-RLT cuts for zero–one integer programs

AU - Yuh, Junsang

AU - Lee, Youngho

PY - 2015/4/3

Y1 - 2015/4/3

N2 - In this paper, we consider the class of 0–1 integer problems and develop an effective cutting plane algorithm that gives valid inequalities called surrogate-RLT cuts (SR cuts). Here we implement the surrogate constraint analysis along with the reformulation–linearization technique (RLT) to generate strong valid inequalities. In this approach, we construct a tighter linear relaxation by augmenting SR cuts to the problem. The level-(Formula presented.) SR closure of a 0–1 integer program is the polyhedron obtained by intersecting all the SR cuts obtained from RLT polyhedron formed over each set of (Formula presented.) variables with its initial formulation. We present an algorithm for approximately optimizing over the SR closure. Finally, we present the computational result of SR cuts for solving 0–1 integer programming problems of well-known benchmark instances from MIPLIB 3.0.

AB - In this paper, we consider the class of 0–1 integer problems and develop an effective cutting plane algorithm that gives valid inequalities called surrogate-RLT cuts (SR cuts). Here we implement the surrogate constraint analysis along with the reformulation–linearization technique (RLT) to generate strong valid inequalities. In this approach, we construct a tighter linear relaxation by augmenting SR cuts to the problem. The level-(Formula presented.) SR closure of a 0–1 integer program is the polyhedron obtained by intersecting all the SR cuts obtained from RLT polyhedron formed over each set of (Formula presented.) variables with its initial formulation. We present an algorithm for approximately optimizing over the SR closure. Finally, we present the computational result of SR cuts for solving 0–1 integer programming problems of well-known benchmark instances from MIPLIB 3.0.

KW - Cutting plane

KW - Integer programming

KW - Partial convexification cuts

KW - Reformulation–linearization technique

KW - Surrogate constraint analysis

KW - Surrogate-RLT cuts

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

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

U2 - 10.1007/s10898-015-0297-0

DO - 10.1007/s10898-015-0297-0

M3 - Article

AN - SCOPUS:84926172537

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

ER -