Fitting a line by minimax method

Now we solve the previous problem by minimizing the objective function 

This procedure is also known as uniform or Chebyshev approximation. We have the introduce the single auxiliary variable s 0 to translate the minimization of (1.83) into the problem 

Proceeding as in the previous section we obtain the linear programming problem s — min, subject to 

The main program is now used with the DATA statements 

102 REH EX. 1.8.3. FITTING A LINE - METHOD 104 REH HERGE 1 . 11 104 REH-----------DATA 

---