Minimum L∞ solution of underdetermined systems of linear equations

Abstract

The problem of obtaining a minimum L∞ solution of an underdetermined system of consistent linear equations is reduced to a linear programming problem. A modified simplex algorithm is then described. In this algorithm no conditions are imposed on the coefficient matrix, minimum computer storage is required and no artificial variables are needed. The algorithm is a simple and fast one. Numerical results are given.