Accession Number:

AD0658814

Title:

IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1967-09-01

Pagination or Media Count:

20.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE