NP-hard problems vary greatly in their approximability; some, such as the Knapsack Problem, can be approximated within a multiplicative factor formula_1, for any fixed formula_2, and therefore produce solutions arbitrarily close to the optimum (such a family of approximation algorithms is called a polynomial time approximation scheme or PTAS).