Return to search

Linear Programming Using the Simplex Method

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.

Identiferoai:union.ndltd.org:unt.edu/info:ark/67531/metadc130787
Date01 1900
CreatorsPatterson, Niram F.
ContributorsAllen, John Ed, 1937-, Dawson, David Fleming
PublisherNorth Texas State University
Source SetsUniversity of North Texas
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation
Formatiii, 67 leaves : ill., Text
RightsPublic, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Patterson, Niram F.

Page generated in 0.0021 seconds