A Variant of the Dual Pivoting Rule in Linear Programming

DOI10.1080/02522667.1994.10699198MaRDI QIDQ4321114zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 803005
• A dual version of Tardos's algorithm for linear programming
• A dual projective pivot algorithm for linear programming
• A variant of the dual simplex method for a linear semidefinite programming problem
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• scientific article; zbMATH DE number 969963
• scientific article; zbMATH DE number 934835
• A dual non-linear program
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A Dual Simplex Algorithm for Piecewise-Linear Programming

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A general phase-I method in linear programming
• A simplex-like method with bisection for linear programming¹
• An improved general Phase-I method in linear programming
• Practical finite pivoting rules for the simplex method
• The Composite Simplex Algorithm

Cited in

(11)

• MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
• A projective simplex algorithm using LU decomposition
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A dual projective simplex method for linear programming
• On simplex method with most-obtuse-angle rule and cosine rule
• Phase I cycling under the most-obtuse-angle pivot rule
• scientific article; zbMATH DE number 803005 (Why is no real title available?)
• Cone-cutting: a variant representation of pivot in simplex
• A basis-defiency-allowing variation of the simplex method for linear programming
• A note on two direct methods in linear programming
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis

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

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