The principal part of this paper is devoted to reworking the equivalence of the Stiefel exchange algorithm for Chebyshev approximation with the simplex algorithm applied to the dual of the linear programming formulation of the same problem. Our main concern has been the provision of algorithms free from the major restrictions of classical approximation theory, and it appears that these restrictions can be relaxed almost entirely.