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

DOI10.1007/S40305-015-0106-YzbMATH Open1368.90101OpenAlexW2200824826MaRDI QIDQ2014048FDOQ2014048

Authors 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)

Recommendations

• A variant of the dual simplex method for a linear semidefinite programming problem
• A dual version of Tardos's algorithm for linear programming
• On an efficient implementation of the face algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A dual projective simplex method for linear programming
• A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• A primal-dual simplex method for linear programs
• A dual method for solving the canonical linear programming problem
• scientific article; zbMATH DE number 943301

Cites work

• scientific article; zbMATH DE number 910295 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• A convergent criss-cross method
• A dual projective pivot algorithm for linear programming
• A dual projective simplex method for linear programming
• A finite conformal-elimination free algorithm over oriented matroid programming
• A projective simplex algorithm using LU decomposition
• A projective simplex method for linear programming
• A simplex-like method with bisection for linear programming¹
• Practical finite pivoting rules for the simplex method
• Programming of Interdependent Activities: II Mathematical Model
• The Criss-Cross Method for Solving Linear Programming Problems
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study

Cited in

(3)

• scientific article; zbMATH DE number 3858832 (Why is no real title available?)
• scientific article; zbMATH DE number 943301 (Why is no real title available?)
• scientific article; zbMATH DE number 980246 (Why is no real title available?)

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

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