ScholarLens Back to search
1967•University of North Texas Digital Library (University of North Texas)Requires access

Linear Programming Using the Simplex Method

Niram F. Patterson

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Simplex algorithm, Linear programming, Revised simplex method, Computer science, Simplex, Programming language, Mathematical optimization, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Linear Programming Using the Simplex Method — Research Paper | ScholarLens