A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming

DOI10.1007/s40305-015-0106-yzbMath1368.90101OpenAlexW2200824826MaRDI QIDQ2014048

Ping-Qi Pan

Publication date: 10 August 2017

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0106-y

zbMATH Keywords

linear programmingGauss-Jordan eliminationbounded-variabledual facedual optimal face

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• A finite conformal-elimination free algorithm over oriented matroid programming
• A projective simplex method for linear programming
• A dual projective simplex method for linear programming
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A dual projective pivot algorithm for linear programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• A projective simplex algorithm using LU decomposition
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method
• A simplex-like method with bisection for linear programming¹
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• Programming of Interdependent Activities: II Mathematical Model

This page was built for publication: A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming