This thesis examines linear programming problems, the theoretical foundations of the simplex method, and how a liner programming problem can be solved with the simplex method.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc130787 |
| Date | 01 1900 |
| Creators | Patterson, Niram F. |
| Contributors | Allen, John Ed, 1937-, Dawson, David Fleming |
| Publisher | North Texas State University |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | iii, 67 leaves : ill., Text |
| Rights | Public, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Patterson, Niram F. |
Page generated in 0.0019 seconds