THE TITLE OF THIS NOTE explains its content as well as its motivation in that the abundance of proofs of an established theorem is taken to connote a continuing interest in its significance. The theorem asserts that whatever final bill of goods can be produced in a general (Static) Leontief model can also be produced by a technique embedded in it. (The terms are defined below). It follows that this technique is optimal for all compositions of final outputs in the sense that given any such composition, one gets the largest size of final outputs by using only this technique. I shall give a direct proof of this statement by formulating a linear programming (LP) problem to maximise the 'size' of final outputs at a given 'composition' and showing that the optimal basis for this problem (which defines a corresponding optimal technique) remains so when the output-composition is changed arbitrarily. The present proof shares its method with the Dantzig-Gale proof of the same theorem, as reported in [1, (303-306)]. To recall, they consider the LP problem of minimising the primary input requirement for producing a given feasible final output vector and show that the same optimal basis is obtained for this problem, whatever the final output vector specified. The main theorem is an easy consequence of this invariance of the optimal basis for either LP problem (the one considered by Dantzig-Gale or by myself). While the two proofs use the same tools and employ the same broad strategy, they differ rather significantly on a technical point. Technically, both proofs are concerned with the sensitivity analysis of an LP problem, say max cx subject to Ax ? b, x > 0 where A is a matrix and b, c and x are vectors of appropriate dimensions (A, b and c are given). The sensitivity analysis is carried out with respect to certain coefficients in the matrix A in the present proof and with respect to the vector b in the Dantzig-Gale proof. The latter type of sensitivity analysis has a much richer body of general results to draw upon than the former. In particular, the Dantzig-Gale proof utilizes precisely such a general result (Lemma 9.3 in [1]), whereas the present proof is entirely self-contained excepting for its dependence on the standard theorems in LP, in common with Dantzig-Gale. For reference, I shall state the relevant theorems in the form they will be used at appropriate places. Their proofs are available in any standard text on LP theory e.g. [1, chapter 3]. Turning to substantive matters, a general Leontief model produces some n goods by means of m > n linear activities obeying the two special assumptions of no joint production and a single primary input, i.e., each activity (a) produces exactly one good, and (b) uses, besides the produced goods, one common non