IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM,

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.

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1967
Accession Number
AD0658814

Entities

People

  • A. M. Geoffrion

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Composite Materials
  • Computer Programming
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Optimization

Fields of Study

  • Mathematics

Readers

  • Operations Research