2013•Contemporary Chemical IndustryRequires access

Solving Linear Programming Problems in the Storage and Transportation by Algorithm Simplex Method

Ren Chuan-qi

Abstract

Linear programming is to use mathematics as a tool to study how to achieve a linear objective optimization under certain restrictions.And the simplex method to solve linear programming problems is the leading method.Based on a common form of the linear programming model,through examples of introducing the simplex method,the optimal solution was obtained by Diego and judgment,gradual approach.And then it's simplified into a table calculation,which can improve the computational efficiency.Finally,application of the simplex table in the storage and transportation was discussed,which can provide a reference to the actual work.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Key concepts: Simplex algorithm, Linear programming, Revised simplex method, Simplex, Linear-fractional programming, Criss-cross algorithm, Table (database), Mathematical optimization