ScholarLens Back to search
2005•Journal of Wuhan Polytechnic UniversityRequires access

IMPROVEMENT OF ALGORITHM OF PROBLEM OF LINEAR PROGRAMMING

Kang Zhou

Open publisher page 0 citations

Abstract

In this paper,basic theory of simplex method is simplified,and is proved more straightway.So is sums up the two-view-one-operation rule of simplex method.

About this research paper

What this paper is about

In this paper,basic theory of simplex method is simplified,and is proved more straightway.So is sums up the two-view-one-operation rule of 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

In this paper,basic theory of simplex method is simplified,and is proved more straightway.So is sums up the two-view-one-operation rule of simplex method.

Key concepts: Linear programming, Computer science, Algorithm, Mathematical optimization, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
IMPROVEMENT OF ALGORITHM OF PROBLEM OF LINEAR PROGRAMMING — Research Paper | ScholarLens