A generalized inverse method for asymptotic linear programming

Consider a linear program in which the entries of the coefficient matrix vary linearly with time. To study the behavior of optimal solutions as time goes to infinity, it is convenient to express the inverse of the basis matrix as a series expansion of powers of the time parameter. The paper shows that an algorithm of Wilkinson for solving singular differential equations can be used to obtain such an expansion efficiently. The resolvent expansions of dynamic programming are a special case of this method.