Accession Number:

AD0770524

Title:

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

Descriptive Note:

Corporate Author:

ARMY FOREIGN SCIENCE AND TECHNOLOGY CENTER CHARLOTTESVILLE VA

Report Date:

1973-08-30

Pagination or Media Count:

14.0

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

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE