A Dual Algorithm to Solve Linear Least Absolute Value Approximations

摘要

This paper presents a special purpose dual linear programming algorithm to solve linear least absolute value problems. In addition, strategies involving start procedures are examined. Implementations of computer-based techniques are discussed. Computational results with three computer code versions of the algorithm are given. (Author)