#### Date of Award

Spring 1967

#### Document Type

Thesis

#### Department

Mathematics, Engineering & Computer Science

#### First Advisor

Alfred Murray

#### Abstract

Programming problems are concerned with the efficient use or allocation of limited resources to meet desired objectives. These problems are characterized by a large number of solutions that satisfy the basic conditions of each problem. However, the over-all objective of the problem requires the selection of a particular solution and this solution which satisfies both the conditions of the problem and the given objective is the optimal solution. In this paper only a very special subclass of programming problems, referred to as linear programming problems, will be considered. The general linear programming problem can be described as follows: Given a set of m linear inequalities in n variables, we wish to find non-negative values of these variables which will satisfy the constraints or conditions and minimize ( maximize ) some linear function of the variables.

#### Recommended Citation

War, Thomas, "Basic Concepts In The Simplex Method Of Linear Programming" (1967). *Mathematics, Engineering and Computer Science Undergraduate Theses*. 122.

https://scholars.carroll.edu/mathengcompsci_theses/122