Optimality Properties of a Special Assignment Problem

S. C. Parikh and Roger Wets
Additional contact information
S. C. Parikh: University of California, Berkeley
Roger Wets: University of California, Berkeley

Operations Research, 1964, vol. 12, issue 1, 139-142

Abstract: In this paper, it is shown that if the cost matrix of an assignment problem has the following property c ij = | j − i | then any basic feasible solution is optimal if and only if its unit components belong to two well-defined symmetric 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. One deals with similar matrices in some problems related to order statistics.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.1.139 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:12:y:1964:i:1:p:139-142

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().