A simplex method based on reducing the constraint conditions of linear programming

DOI10.3969/J.ISSN.1673-3193.2017.04.003MaRDI QIDQ3131805zbMATH OpenFDO

Authors Yinmin Gao, Jian-Bin Chen

Publication date 29 January 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.1673-3193.2017.04.003

zbMATH Keywords

constraint conditionslinear programmingsimplex method

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4072707
• An improved algorithm of simplex method in linear programming problem
• scientific article; zbMATH DE number 1504438
• scientific article; zbMATH DE number 3852786
• Balance constraints reduction of large-scale linear programming problems

Cited in

(11)

• A constraint selection technique for a class of linear programs
• Eliminating columns in the simplex method for linear programming
• Balance constraints reduction of large-scale linear programming problems
• scientific article; zbMATH DE number 4158377 (Why is no real title available?)
• An improved algorithm of simplex method in linear programming problem
• scientific article; zbMATH DE number 4072707 (Why is no real title available?)
• scientific article; zbMATH DE number 4093174 (Why is no real title available?)
• scientific article; zbMATH DE number 4123522 (Why is no real title available?)
• scientific article; zbMATH DE number 769132 (Why is no real title available?)
• A comparative study of redundant constraints identification methods in linear programming problems
• Simple LPO constraint solving methods

This page was built for publication: A simplex method based on reducing the constraint conditions of linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3131805)