Westinghouse Electric Corporation

Frederick G Huff

Richard E Putman

Thomas Allen

John J Novacek

A linear programming matrix is used to represent a complex process with many interrelated process variables. Assumptions are initially made regarding the values of the matrix elements, based on current or expected operation of the process. After the linear programming matrix is solved, the values of the coefficients are modified according to a test strategy and the linear programming matrix is again solved in an effort to obtain a better result. This process is repeated until solutions of matrix converge and the amount of modification of the matrix is minimal. One test strategy that can be used is SIMPLEX self-directing evolutionary operation. Another test strategy uses progressively more accurate linear approximations of nonlinear relationships in the linear programming matrix.

Growing community of inventors

Pittsburgh, PA, United States of America

Frederick G Huff