Generalization of Dilworth's Theorem on Minimal Chain Decomposition

M. Raghavachari and V. L. Mote
Additional contact information
M. Raghavachari: Carnegie-Mellon University
V. L. Mote: Indian Institute of Management, Ahmedabad

Management Science, 1970, vol. 16, issue 7, 508-511

Abstract: The decomposition of a finite partially ordered set of elements as a union of chains was considered by Dilworth [2]. Dantzig and Hoffman [1] formulated this problem as a linear programming problem and obtained Dilworth's theorem from duality theory. For some practical applications and for a method to obtain a minimal decomposition see Ford and Fulkerson [3]. In this paper we generalize this problem to the case when the set is not necessarily partially ordered and obtain a method of finding a minimal chain decomposition of the set.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.7.508 (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:16:y:1970:i:7:p:508-511

Access Statistics for this article

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