The minimization of a convex function of variables subject to linear inequalities is discussed briefly in general terms. Dantzig's Simplex Method is extended to yield finite algorithms for minimizing ...

We suggest reducing the design matrix to row echelon form as a means of finding the structure of all estimable functions. We illustrate the procedure with two examples.