Key points are not available for this paper at this time.
By modifying the simplex method of linear programming, we are able to present an algorithm for l₁ -approximation which appears to, be superior computationally to any other known algorithm for this problem.
Barrodale et al. (Mon,) studied this question.