Accession Number : AD0658814

Title :   IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Geoffrion,A. M.

Report Date : SEP 1967

Pagination or Media Count : 20

Abstract : The report discusses a zero-one integer linear programming code for solving a general class of discrete optimization problems. The code is designed for problems of up to 90 binary variables and 50 constraints. Two main approaches are used to reduce computing time: (1) periodic application of linear programming to continuous approximations to subproblems generated by partial solutions; (2) periodic introduction of composite redundant constraints. By introducing a measure of 'strength,' strong composite constraints can be computed by linear programming.

Descriptors :   (*LINEAR PROGRAMMING, *OPTIMIZATION), NUMERICAL METHODS AND PROCEDURES, ALGORITHMS, MATHEMATICAL PROGRAMMING, SCHEDULING, APPROXIMATION(MATHEMATICS), ITERATIONS, AIR FORCE

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE