Accession Number:

AD0670735

Title:

AN IMPROVED IMPLICIT ENUMERATION APPROACH FOR INTEGER PROGRAMMING,

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV LOS ANGELES WESTERN MANAGEMENT SCIENCE INST

Personal Author(s):

• Geoffrion,A. M.

Report Date:

1968-05-01

Pagination or Media Count:

33.0

Abstract:

The memorandum synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by Land and Doig and by Roy, Bertier and Nghiem. The synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as strong as possible in a sense slightly different from that originally used by Glover. A very simple implicit enumeration algorithm fitted with optional imbedded linear programming machinery was implemented and tested extensively on an IBM 7044. Use of the imbedded linear program dramatically reduced solution times in virtually every case, and sufficed to render the tested algorithm superior to the five other implicit enumeration algorithms for which comparable published experience was available. It would appear that the present approach permits the routine solution of practical integer programs involving hundreds of variables. Author

Descriptors:

• (*MATHEMATICAL PROGRAMMING
• PROBLEM SOLVING)
• LINEAR PROGRAMMING
• SIMPLEX METHOD
• OPTIMIZATION
• NETWORKS
• GRAPHICS
• COMPUTER PROGRAMMING
• EFFICIENCY
• ALGORITHMS

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE