Linear optimization and image reconstruction
Rhoden, Christopher A.
Henson, V. Emden
MetadataShow full item record
The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite models, including applications in transportation, production planning, and scheduling, have made the algorithm an indispensable tool to many operations researchers. This thesis is primarily an exploration of the simplex algorithm, and a discussion of the utility of the algorithm in unconventional optimization problems. The mathematical theory upon which the algorithm is based and a general description of the algorithm are presented. The reader is assumed to have little exposure to convexity, duality, or the Simplex algorithm itself. More important to the thesis are the examples that accompany the discussion of the Simplex algorithm. Herein are a variety of unusual applications for the algorithm, including applications in infinite dimensional vector spaces, uniform approximation, and computer assisted tomographic image reconstruction. These examples serve both to facilitate a better understanding of the algorithm, and to present it in unusual settings
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Bradley, Gordon H.; Brown, Gerald G.; Graves, Glen W. (1977-09);A complete description is given of the design, implementation and use of a family of very fast and efficient large scale minimum cost (primal simplex) network programs. The class of capacitated transshipment problems ...
Bradley, Gordon H.; Brown, Gerald G.; Graves, Glenn W. (1977-09);A complete description is given of the design, implementation and use of a family of very fast and efficient large scale minimum cost (primal simplex) network programs. The class of capacitated transshipment problems solved ...
Bretschneider, Guenter W. (1985-09);An algorithm to solve linear programming problems is presented which is based on Karmarkar's projective method. The algorithm includes a practical method to project a general linear programming problem onto a unit simplex ...