INSTRUCTIONS FOR USING EXPERIMENTAL 0-1 INTEGER LINEAR PROGRAMMING CODE RIP23J

Abstract

The program solves integer linear programs of the form (P) Minimize cx subject to b + Ax = or > 0, x sub j = 0 or 1 where c and x are n-vectors, b is an m-vector, and A is m by n. Any bounded integer linear program can be written in this form, using elementary manipulations if necessary. Familiarity with 2 previous papers in the series is assumed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1967
Accession Number
AD0662007

Entities

People

  • A. B. Nelson
  • A. M. Geoffrion

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Composite Materials
  • Computer Programming
  • Corporations
  • Evolutionary Algorithms
  • Heuristic Methods
  • Instructions
  • Integer Programming
  • Iterations
  • Language
  • Linear Programming
  • Machine Languages
  • Procedures (Computers)

Fields of Study

  • Mathematics

Readers

  • Analytical Mechanics
  • Computer Science.
  • Regression Analysis.