  I propose a new approach to solving standard screening problems when the
monotonicity constraint binds. A simple geometric argument shows that when
virtual values are quasi-concave, the optimal allocation can be found by
appropriately truncating the solution to the relaxed problem. I provide a
simple algorithm for finding this optimal truncation when virtual values are
concave.
