OPTIMALITY PROPERTIES OF A SPECIAL ASSIGNMENT PROBLEM

Abstract

If the cost matrix of an assignment proble has the following property CIJ = J - I then any basic feasible solution is opitimal if and only if its unit components belong to two well defined symmetirc regions. The matrix with above mentioned property is called the REORDERING MATRIX, because it arose for the first time in the reordering of nodes of a critical path and other acyclic network problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 03, 1962
Accession Number
AD0296898

Entities

People

  • Roger J-B Wets
  • S.c. Parikh

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • California
  • Contracts
  • Government Procurement
  • Governments
  • Linear Programming
  • Mathematics
  • Military Research
  • Navy
  • New Jersey
  • New York
  • Operations Research
  • Rhode Island
  • United States
  • Universities

Readers

  • Operations Research