In this paper a general theory of the elimination process (vertex elimination on a graph) is developed. The connections of this theory with the secondary optimization problem of Nonserial Dynamic Programming and with the numerical solution of systems of linear equations by Gaussian elimination are pointed out.