# What is the relationship between $\mathsf{PLS}$ and $\mathsf{APX}$?

What is the relationship between $\mathsf{PLS}$ and $\mathsf{APX}$? In other words, are problems that admit a polynomial time local search approximable? Do approximable optimization problems imply a local search algorithm in general?