Linear Programming Simplex Method

Linear programming is an area of linear algebra. In which the goal is to maximize or minimize a linear functions. The solution can be constructed using the simplex method and is attributed to George Dantzig (1914 - ) who was born in Portland, Oregon. The simplex method starts at the origin and follows a path along the edges of the polytope to the vertex where the maximum occurs. The method uses the concept of a simplex which is a polytope of N + 1 vertices in N dimensions: a line segment in one dimension, a triangle in two dimensions, a tetrahedron in three-dimensional space and so forth. More on this method can be be found at people.hofstra.edu/Stefan_Waner/tutorialsf4/unit4_3.html