Thesis - Open Access
Master of Science (MS)
Department / School
Programming is defined as the planning of activities for the sake of optimization. When linear constraints are ·assumed, together with a linear objective function, the optimization is defined as solving a linear programming problem. Linear programming was originally developed by Dantzig, Wood and (others for the U.S. Air Force. Since it was first published in 1947, it has been used widely in industrial as well as military situations.
Examples of specific exotic and straight forward applications of the linear programming technique can be found in text books, monographs and technical papers in the several fields in which it has been used. The simplex procedure is the most powerful and efficient technique in existence for the solution of linear programming problems. It is assumed that the reader is familiar with the basic simplex procedure and nomenclature. Within the generalized simplex method, there are several specialized techniques that are superior for specific problem areas.
Library of Congress Subject Headings
Number of Pages
South Dakota State University
Batr, Arjun Kumar, "A Study of the Properties of Parametric Programming" (1971). Electronic Theses and Dissertations. 3697.