Accession Number:

AD0672255

Title:

AN IMPROVED IMPLICIT ENUMERATION APPROACH FOR INTEGER PROGRAMMING

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

• Geoffrion, A. M.

Report Date:

1968-06-01

Pagination or Media Count:

33.0

Abstract:

The report presents a synthesis of the Balasian implicit enumeration approach to integer linear programming with the approach typified by Land and Doig and by Roy, Bertier, and Nghiem. This 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 computer. Use of the imbedded linear program dramatically reduced solution time in virtually every case and sufficied to render the tested algorithm superior to the other five implicit enumeration algorithms for which comparable published experience was available. Existing evidence suggests that the present approach should permit the routine solution of practical integer problems involving hundreds of variables.

Descriptors:

• *COMPUTER PROGRAMMING
• *LINEAR PROGRAMMING
• ALGORITHMS
• OPTIMIZATION
• PROBLEM SOLVING
• NUMERICAL METHODS AND PROCEDURES
• SCHEDULING
• EFFICIENCY
• MANAGEMENT PLANNING AND CONTROL
• DECISION MAKING

Subject Categories:

• Operations Research
• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE