CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
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.