A dual projective simplex method for linear programming

DOI10.1016/S0898-1221(98)00024-8zbMath0907.90208MaRDI QIDQ1129474

Ping-Qi Pan

Publication date: 2 March 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

least squares problemdual crash heuristicNETLIBprojective simplex method

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (9)

A phase-1 approach for the generalized simplex algorithm ⋮ 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 primal deficient-basis simplex algorithm for linear programming ⋮ Dual–primal algorithm for linear optimization ⋮ 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 ⋮ An affine-scaling pivot algorithm for linear programming

Uses Software

• DEVEX
• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• The economical storage of plane rotations
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• Steepest-edge simplex algorithms for linear programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• Numerical methods for solving linear least squares problems
• Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form
• A simplex-like method with bisection for linear programming¹
• Methods for Computing and Modifying the LDV Factors of a Matrix
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Factorized Variable Metric Methods for Unconstrained Optimization
• A Variant of the Dual Pivoting Rule in Linear Programming
• Methods for Modifying Matrix Factorizations
• Inductive Proof of the Simplex Method
• Pivot selection methods of the Devex LP code

This page was built for publication: A dual projective simplex method for linear programming