AN EXTENSION OF THE BOUND ESCALATION METHOD FOR INTEGER PROGRAMMING: A PSEUDO PRIMAL-DUAL ALGORITHM OF THE GOMORY ALL-INTEGER VARIETY

Abstract

An extension of the bound escalation method is presented that enables the customary dual feasibility requirement in the integer programming tableau to be systematically violated and then restored. The bound escalation method itself is composed of two stages. In the first stage a structure called the bounding form is created by applying a series of nonsingular integer transformations to the problem matrix. The second stage then operates on the bounding form to obtain lower bounds for a subset of the current problem variables and thereby to advance the problem toward solution.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1965
Accession Number
AD0620176

Entities

People

  • Fred Glover

Organizations

  • Carnegie Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Equations
  • Evolutionary Algorithms
  • Heuristic Methods
  • Inequalities
  • Integer Programming
  • Iterations
  • Linear Programming
  • Military Research
  • Numbers
  • Rational Numbers
  • Simplex Method
  • United States
  • United States Government

Readers

  • Operations Research
  • Strategic Security Studies