Courtship and linear programming Original Research Article

This paper demonstrates that the celebrated Gale-Shapley algorithm for obtaining stable matchings in stable marriage problems is essentially an application of the dual simplex method.