A branch and bound algorithm with constraint partitioning for integer goal programming problems

Jeffrey L. Arthur, Arunachalam Ravindran

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Using constraint partitioning and variable elimination, the authors have recently developed an efficient algorithm for solving linear goal programming problems. However, many goal programs require some or all of the decision variables to be integer valued. This paper shows how the new partitioning algorithm can be extended with a modified branch and bound strategy to solve both pure and mixed type integer goal programming problems. A potential problem in combining the partitioning algorithm and the branch and bound search scheme is presented and resolved.

Original languageEnglish (US)
Pages (from-to)421-425
Number of pages5
JournalEuropean Journal of Operational Research
Volume4
Issue number6
DOIs
StatePublished - Jan 1 1980

Fingerprint

Goal Programming
Branch and Bound Algorithm
Integer programming
Integer Programming
Partitioning
Branch-and-bound
Potential Problems
Linear programming
Elimination
Efficient Algorithms
Integer
Goal programming
Branch and bound algorithm

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

@article{c42de62c130e4a7d8b40b5bcad2d2395,
title = "A branch and bound algorithm with constraint partitioning for integer goal programming problems",
abstract = "Using constraint partitioning and variable elimination, the authors have recently developed an efficient algorithm for solving linear goal programming problems. However, many goal programs require some or all of the decision variables to be integer valued. This paper shows how the new partitioning algorithm can be extended with a modified branch and bound strategy to solve both pure and mixed type integer goal programming problems. A potential problem in combining the partitioning algorithm and the branch and bound search scheme is presented and resolved.",
author = "Arthur, {Jeffrey L.} and Arunachalam Ravindran",
year = "1980",
month = "1",
day = "1",
doi = "10.1016/0377-2217(80)90194-0",
language = "English (US)",
volume = "4",
pages = "421--425",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "6",

}

A branch and bound algorithm with constraint partitioning for integer goal programming problems. / Arthur, Jeffrey L.; Ravindran, Arunachalam.

In: European Journal of Operational Research, Vol. 4, No. 6, 01.01.1980, p. 421-425.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A branch and bound algorithm with constraint partitioning for integer goal programming problems

AU - Arthur, Jeffrey L.

AU - Ravindran, Arunachalam

PY - 1980/1/1

Y1 - 1980/1/1

N2 - Using constraint partitioning and variable elimination, the authors have recently developed an efficient algorithm for solving linear goal programming problems. However, many goal programs require some or all of the decision variables to be integer valued. This paper shows how the new partitioning algorithm can be extended with a modified branch and bound strategy to solve both pure and mixed type integer goal programming problems. A potential problem in combining the partitioning algorithm and the branch and bound search scheme is presented and resolved.

AB - Using constraint partitioning and variable elimination, the authors have recently developed an efficient algorithm for solving linear goal programming problems. However, many goal programs require some or all of the decision variables to be integer valued. This paper shows how the new partitioning algorithm can be extended with a modified branch and bound strategy to solve both pure and mixed type integer goal programming problems. A potential problem in combining the partitioning algorithm and the branch and bound search scheme is presented and resolved.

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

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

U2 - 10.1016/0377-2217(80)90194-0

DO - 10.1016/0377-2217(80)90194-0

M3 - Article

AN - SCOPUS:0019026963

VL - 4

SP - 421

EP - 425

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 6

ER -