2009Unpublished venueRequires access

Linear Programming: Solution Methods

Der‐San Chen, Robert G. Batson, Yu Dang

Open publisher page 0 citations

Abstract

This chapter contains sections titled: Linear Programs in Canonical Form Basic Feasible Solutions and Reduced Costs The Simplex Method Interpreting the Simplex Tableau Geometric Interpretation of the Simplex Method The Simplex Method for Upper Bounded Variables The Dual Simplex Method The Revised Simplex Method Notes Exercises

About this research paper

What this paper is about

This chapter contains sections titled: Linear Programs in Canonical Form Basic Feasible Solutions and Reduced Costs The Simplex Method Interpreting the Simplex Tableau Geometric Interpretation of the Simplex Method The Simplex Method for Upper Bounded Variables The Dual Simplex Method The Revised Simplex Method Notes Exercises

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 chapter contains sections titled: Linear Programs in Canonical Form Basic Feasible Solutions and Reduced Costs The Simplex Method Interpreting the Simplex Tableau Geometric Interpretation of the Simplex Method The Simplex Method for Upper Bounded Variables The Dual Simplex Method The Revised Simplex Method Notes Exercises

Key concepts: Simplex algorithm, Simplex, Revised simplex method, Linear programming, Mathematical optimization, Mathematics, Bounded function, Interpretation (philosophy)

Related papers

Back to paper searchBrowse research topicsOriginal source
Linear Programming: Solution Methods — Research Paper | ScholarLens