Accession Number:

AD0753473

Title:

0-1 Programming for Column-Chained Matrices under Vector Partial Ordering

Personal Author(s):

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Report Date:

1972-08-01

Abstract:

The paper presents a technique for solving a set of 0-1 programming problems where the columns can be permuted so that all row coefficients are monotone increasing. Such matrices are column-chained under vector partial ordering. The technique is based on equivalence classes that exist on the unit hypercube and for the set of problems described, the approach reduces the set of possible solutions to a subset in which the optimal must lie. An example is presented.

Descriptive Note:

Research rept.

Supplementary Note:

Revision of report dated May 1972.

Pages:

0022

Subject Categories:

Distribution Statement:

Approved for public release; distribution is unlimited.

Contract Number:

N00014-67-A-0314-0007

File Size:

0.78MB