Before revision: We consider discrete linear Chebyshev approximation problems , where the approximation criterion to minimize by fitting the unknown parameters of a linear function takes the form of the least maximum absolute deviation of errors. Approximation problems of this kind find application in the solution of overdetermined systems of linear equations that appear in many practical contexts.
After revision: We consider discrete linear Chebyshev approximation problems , where the approximation criterion to minimize by fitting the unknown parameters of a linear function takes the form of the least maximum absolute deviation of approximation errors. Such problems find wide application in the solution of overdetermined systems of linear equations that appear in many practical contexts.