ScholarLens Back to search
2004•Journal of Nanjing Institute of Industry TechnologyRequires access

A Comparison between Two Teaching Methods of Linear Programming

Cai Cheng-wen

Open publisher page 0 citations

Abstract

The problems of linear programming are usually solved by simplex method.This paper discusses the thought of dealing with simplex method by matrix and Gauss elimination,which is easy for students to understand,master and apply linear programming.

About this research paper

What this paper is about

The problems of linear programming are usually solved by simplex method.This paper discusses the thought of dealing with simplex method by matrix and Gauss elimination,which is easy for students to understand,master and apply linear programming.

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

The problems of linear programming are usually solved by simplex method.This paper discusses the thought of dealing with simplex method by matrix and Gauss elimination,which is easy for students to understand,master and apply linear programming.

Key concepts: Simplex algorithm, Linear programming, Revised simplex method, Computer science, Linear-fractional programming, Matrix (chemical analysis), Simplex, Gauss

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Comparison between Two Teaching Methods of Linear Programming — Research Paper | ScholarLens