ScholarLens Back to search
2012•Journal of Hengyang Normal UniversityRequires access

A Note on Simplex Method and Dual Simplex Method

Liao Xiao-min

Open publisher page 0 citations

Abstract

For every linear programming problem,the paper shows that it can get the condition of solutions to this linear programming problem and its dual problem only based on a simplex tableau by adopting the simplex method or the dual simplex method.And its verified by Lingo.

About this research paper

What this paper is about

For every linear programming problem,the paper shows that it can get the condition of solutions to this linear programming problem and its dual problem only based on a simplex tableau by adopting the simplex method or the dual simplex method.And its verified by Lingo.

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

For every linear programming problem,the paper shows that it can get the condition of solutions to this linear programming problem and its dual problem only based on a simplex tableau by adopting the simplex method or the dual simplex method.And its verified by Lingo.

Key concepts: Simplex algorithm, Revised simplex method, Simplex, Linear programming, Dual (grammatical number), Mathematical optimization, Mathematics, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Note on Simplex Method and Dual Simplex Method — Research Paper | ScholarLens