Matrix Rounding Problems

Michael Bacharach
Additional contact information
Michael Bacharach: Cambridge University

Management Science, 1966, vol. 12, issue 9, 732-742

Abstract: The problem considered in this paper is that of consistently rounding off the elements of a matrix and its row and column sums. It is shown that a class of rounding problems of this kind is equivalent to a class of problems of determining flows through networks having arbitrary lower as well as upper bounds on edge flows. An existence theorem first proved by Hoffman for flows in such networks is used to show that an important subclass of the matrix rounding problems considered is always soluble. An algorithm for the entire class is illustrated by a numerical example.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.9.732 (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:ormnsc:v:12:y:1966:i:9:p:732-742

Access Statistics for this article

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