The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study

DOI10.1016/S0377-2217(96)00027-6zbMath0921.90119MaRDI QIDQ1278948

Ping-Qi Pan

Publication date: 27 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simplex algorithmmost-obtuse-angle ruledual feasibilitynew pivot rules

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (15)

A phase-1 approach for the generalized simplex algorithm ⋮ Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ A dual projective simplex method for linear programming ⋮ On the simplex algorithm initializing ⋮ A projective simplex algorithm using LU decomposition ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule ⋮ Book review of: P.-Q. Pan, Linear programming computation ⋮ Phase I cycling under the most-obtuse-angle pivot rule ⋮ On simplex method with most-obtuse-angle rule and cosine rule ⋮ A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ A note on two direct methods in linear programming ⋮ An affine-scaling pivot algorithm for linear programming

Uses Software

• MINOS
• DEVEX
• NETLIB LP Test Set

Cites Work

• Practical finite pivoting rules for the simplex method
• Vector processing in simplex and interior methods for linear programming
• Steepest-edge simplex algorithms for linear programming
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• A practicable steepest-edge simplex algorithm
• A Variant of the Dual Pivoting Rule in Linear Programming
• Inductive Proof of the Simplex Method
• Pivot selection methods of the Devex LP code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study