Consider the following
problem: given a ground set and two minimization objectives of the same type
find a subset from a given subset-class that minimizes the first objective
subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an
earlier weakly polynomial time algorithm.