A Solution Algorithm for One Class of Problems of Linear Programming with Boolean Variables,

Abstract

An algorithm based on the method of branches and limits is suggested for the solution of a linear programming problem. The solution to the problem consists of partitioning the whole set of allowable maps of the problem into two non-intersecting subsets one of which is solved, the second is broken into more non-intersecting subsets, etc. After a finite number of indicated actions, a set which contains only a single map is obtained. If the valve of the special function of this map is the highest of the upper bounds which have been calculated, then the map is optimal. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Aug 30, 1973
Accession Number
AD0770524

Entities

People

  • A. V. Krushevskii
  • M. E. Primak
  • R. A. Polyak

Organizations

  • United States Army Foreign Science and Technology Center

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Language
  • Linear Programming
  • Mathematics
  • Natural Languages
  • Russian Language
  • Simplex Method

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Artificial Intelligence
  • Computer Vision.
  • Statistical inference.