Accession Number:

AD0620176

Title:

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

Descriptive Note:

Management sciences research rept.

Corporate Author:

CARNEGIE INST OF TECH PITTSBURGH PA GRADUATE SCHOOL OF INDUSTRIAL ADMINISTRATION

Personal Author(s):

Report Date:

1965-07-01

Pagination or Media Count:

34.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE