
Accession Number : AD0770524
Title : A Solution Algorithm for One Class of Problems of Linear Programming with Boolean Variables,
Corporate Author : ARMY FOREIGN SCIENCE AND TECHNOLOGY CENTER CHARLOTTESVILLE VA
Personal Author(s) : Krushevskii,A. V. ; Polyak,R. A. ; Primak,M. E.
Report Date : 30 AUG 1973
Pagination or Media Count : 14
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 nonintersecting subsets one of which is solved, the second is broken into more nonintersecting 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)
Descriptors : *Linear programming, *Boolean algebra, Algorithms, Computer programming, Translations, USSR
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE