THE DUAL SIMPLEX METHOD AND ITS APPLICATION TO THE SYNTHESIS OF MINIMAL WEIGHTS
LOCKHEED MISSILES AND SPACE CO INC SUNNYVALE CA
Pagination or Media Count:
This report describes an algorithm for applying the dual, simplex method in linear programming to the problem of determining whether or not a given switching function is linearly separable. Further, where separability is possible, a description is given of the application of the dual simplex method to finding the most economic system of weights and threshold. A detailed elementary exposition of the dual simplex method is given in Sections 2 through 4. A completely worked out illustrative numerical example is presented in Section 5. In Sections 6 through 8, the dual simplex method is applied to the problem of determining minimal weights and threshold this is illustrated by a numerical example which reduces to the example given in Section 5.
- Operations Research