An objective hyperplane search procedure for solving the general all-integer linear programming ( ILP) problem

Anito Joseph, Saul I. Gass, Noel Bryson

Research output: Contribution to journalArticle

5 Scopus citations


We describe an objective hyperplane search method for solving a class of integer linear programming (ILP) problems. We formulate the search as a bounded knapsack problem and develop requisite theory for formulating knapsack problems with composite constraints and composite objective functions that facilitate convergence to an ILP solution. A heuristic solution algorithm was developed and used to solve a variety of test problems found in the literature. The method obtains optimal or near-optimal solutions in acceptable ranges of computational effort.

Original languageEnglish (US)
Pages (from-to)601-614
Number of pages14
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Feb 1 1998



  • Bounded knapsack problem
  • Composite constraints
  • General integer variables
  • Integer-programming
  • Objective hyperplane search

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this