Maximum matching in a convex bipartite graph

A special matching problem arising in industry is shown to be solvable by an algorithm of the form: match objects a_i and b_j if they satisfy a local optirnality criterion based on a ranking of currently unmatched objects. When no a_i and b_i remain that can be matched, the largest number of acceptable matches has been found.