BALGOR: A PROGRAM FOR SOLVING LINEAR PROGRAMS IN ZERO-ONE VARIABLES.

Abstract

The program solves for the X the linear program: Minimize C.DOT.X Subject to A*X.LE.Y where A is an array M x N (M.LE.256), Y is an array M x 1, C is an array N x 1 of given fixed-point numbers, and X is an array N x 1 of zeroes and ones. The code achieves housekeeping economies by the use of an especially written threaded list processor THLP94 available separately.

Document Details

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

Entities

People

  • Stephan J. Wersan

Organizations

  • The Aerospace Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Readers

  • Mycotoxin ecology in Amazonian ecosystems.
  • Parallel and Distributed Computing.
  • Statistical inference.