  It is well known that recurrent sandpile configurations can be characterized
as the optimal solution of certain optimization problems. In this article, we
present two new integer linear programming models, one that computes recurrent
configurations and other that computes the order of the configuration. Finally,
by using duality of linear programming, we are able to compute the identity
configuration for the cone of a regular graph.
