A classical theorem of Hardy, Littlewood, and Polya on rearrangements of functions is used to prove the equivalence of a class of variational problems. As a consequence, solutions are shortest paths and can be computed numerically via quadratic programming. Applications include solar cars and reservoirs.