A new revised simplex method for degenerate linear programs

zbMATH Open1265.90212MaRDI QIDQ4901344FDOQ4901344

Authors: Hai-feng Zhao, Xinwei Liu 

Publication date: 24 January 2013

Recommendations

• On the solution of degenerate problems of linear programming
• scientific article; zbMATH DE number 1064823
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• A strictly improving linear programming Phase I algorithm
• scientific article

zbMATH Keywords

degeneracysimplex methodlinear programs

Mathematics Subject Classification ID

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

Cited In (17)

• Title not available (Why is that?)
• An improved primal simplex algorithm for degenerate linear programs
• Parametric linear programming and anti-cycling pivoting rules
• Making progress during a stall in the simplex algorithm
• A new steepest edge approximation for the simplex method for linear programming
• The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A new version of the improved primal simplex for degenerate linear programs
• Title not available (Why is that?)
• The positive edge pricing rule for the dual simplex
• Removing degeneracy in LP-type problems revisited
• A revised simplex method of solving degenerate fuzzy number linear programming problems
• Alternative approach to revised simplex method
• On the solution of highly degenerate linear programmes
• A new pivoting rule for solving various degeneracy problems
• On the solution of degenerate problems of linear programming
• Title not available (Why is that?)

This page was built for publication: A new revised simplex method for degenerate linear programs

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