A finite dimensional linear programming approximation of Mather's variational problem
Luca Granieri · ESAIM Control Optimisation and Calculus of Variations · 2009
We provide an approximation of Mather variational problem by finite dimensional minimization problems in the framework of Γ-convergence. By a linear programming interpretation as done in [Evans and Gomes, ESAIM: COCV 8 (2002) 693–702] we state a duality theorem for the Mather problem, as well a finite dimensional approximation for the dual problem.