  Operations research applications often pose multicriteria problems.
Mathematical research on multicriteria problems predominantly revolves around
the set of Pareto optimal solutions, while in practice, methods that output a
single solution are more widespread. In real-world multicriteria optimization,
reference point methods are widely used and successful examples of such
methods. A reference point solution is the solution closest to a given
reference point in the objective space.
  We study the approximation of reference point solutions. In particular, we
establish that approximating reference point solutions is polynomially
equivalent to approximating the Pareto set. Complementing these results, we
show for a number of general algorithmic techniques in single criteria
optimization how they can be lifted to reference point optimization. In
particular, we lift the link between dynamic programming and FPTAS, as well as
oblivious LP-rounding techniques. The latter applies, e.g., to Set Cover and
several machine scheduling problems.
