Consider the asymmetric assignment problem and apply forward auction starting with the zero price vector and the empty assignment. Show that, for a feasible problem, the algorithm terminates with a feasible assignment that is within m of being optimal