© 1972 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
On minimax solutions of linear equations*

Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, New York, USA
An algorithm for computing the Chebyshev solution of a system of inconsistent linear equations is given. The algorithm, which is similar to the Revised Simplex method of linear programming, is a consequence of a reformulation of the ascent algorithm and the use of generalised inverses.
Received October 1968.
* This research was supported by the National Aeronautical and Space Administration, Washington, DC, Grant No. NGR-33-015-013.
Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, New York, 11790, USA