An algorithmic approach to maximal unions of chains in a partially ordered set

We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a finite partially ordered set P for every positive integer k. As a consequence, we obtain an algorithmic proof of Greene's Duality Theorem on the relations between the cardinalities of maximal unions of chains and antichains in a finite poset.