Fixed-parameter tractability and approximation through linear programming

We review classical and recent applications of linear programming in parameterized complexity and approximation algorithms. These range from the standard vertex cover problem to the maximum independent set problem for geometric objects.