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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1972
Accession Number
AD0753473

Entities

People

  • V. J. Bowman

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Coefficients
  • Computer Programming
  • Contracts
  • Dynamic Programming
  • Equations
  • Heuristic Methods
  • Inequalities
  • Military Research
  • Optimization
  • Pennsylvania
  • Schools
  • Supply Chain Management
  • Universities

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Operations Research