Antichain sequences

For any finite partially ordered set S we display a dual transportation system of linear inequalities, and a bijection A(x) from the maximal integer-valued solutions x of this system onto the maximal sequences of k antichains in S. This provides a simple translation to a dual transportation problem of the problem: find a maximum weight union of k antichains.Research supported by the Natural Sciences and Engineering Research of Canada.