Accession Number:

ADA017936

Title:

Improved Bounds for a Class of 0-1 Integer Programs Using Combined Surrogate-Lagrangean Techniques

Descriptive Note:

Research rept.

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

• Glover, Fred
• Ross, G. T.

Report Date:

1975-06-01

Pagination or Media Count:

25.0

Abstract:

A new method is described for calculating bounds for a special class of 0-1 integer programming problems. This method includes features of both Lagrangean and surrogate relaxation approaches. Certain binary knapsack calculations carried out in appropriate combinations together with an additivity principle provide the basis for computing the bounds.

Descriptors:

• *INTEGER PROGRAMMING
• *LINEAR PROGRAMMING
• LAGRANGIAN FUNCTIONS
• THEOREMS

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE