A Variant of the Dual Pivoting Rule in Linear Programming

DOI10.1080/02522667.1994.10699198zbMath0816.90102OpenAlexW2056278119MaRDI QIDQ4321114

Ping-Qi Pan

Publication date: 19 January 1995

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1994.10699198

zbMATH Keywords

dual simplex methodprimal feasibilitydual pivoting rule

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (8)

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 ⋮ Phase I cycling under the most-obtuse-angle pivot rule ⋮ On simplex method with most-obtuse-angle rule and cosine 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 ⋮ A note on two direct methods in linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• A general phase-I method in linear programming
• An improved general Phase-I method in linear programming
• A simplex-like method with bisection for linear programming¹
• The Composite Simplex Algorithm

This page was built for publication: A Variant of the Dual Pivoting Rule in Linear Programming