A dual projective pivot algorithm for linear programming

DOI10.1023/B:COAP.0000044185.69640.54MaRDI QIDQ1771222zbMATH OpenOpenAlexFDO

Authors Ping-Qi Pan

Publication date 7 April 2005

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:coap.0000044185.69640.54

zbMATH Keywords

linear programmingprojectionpivotdual algorithmpseudo-basis

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A dual projective simplex method for linear programming
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A projective simplex method for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• A projective algorithm for linear programming with no regularity condition

Cited in

(17)

• scientific article; zbMATH DE number 6613080 (Why is no real title available?)
• A pivoting algorithm for linear programming with linear complementarity constraints
• Probing through the intersection of hyperplanes
• A projective simplex algorithm using LU decomposition
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A self-adjoint algorithm for solving linear programming problems
• An affine-scaling pivot algorithm for linear programming
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A combined phase I-phase II projective algorithm for linear programming
• The pivot and probe algorithm for solving a linear program
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• A sparse proximal implementation of the LP dual active set algorithm
• A Variant of the Dual Pivoting Rule in Linear Programming
• A primal deficient-basis simplex algorithm for linear programming
• Restricted vertex generation applied as a crashing procedure for linear programming

Describes a project that uses

Uses Software

• NETLIB LP Test Set

This page was built for publication: A dual projective pivot algorithm for linear programming

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