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

Jeffrey L. Arthur, Arunachalam Ravindran

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

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

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'A branch and bound algorithm with constraint partitioning for integer goal programming problems'. Together they form a unique fingerprint.

Cite this