scientific article; zbMATH DE number 883252

zbMath0844.90055MaRDI QIDQ4879697

Ping-Qi Pan

Publication date: 2 June 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dual simplex algorithmdual feasibilitynon-monotone procedures

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (6)

A dual projective simplex method for linear programming ⋮ A projective simplex algorithm using LU decomposition ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study

This page was built for publication: