A dual projective simplex method for linear programming

DOI10.1016/S0898-1221(98)00024-8zbMATH Open0907.90208MaRDI QIDQ1129474FDOQ1129474

Authors: Ping-Qi Pan 

Publication date: 2 March 1999

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

Recommendations

• A dual projective pivot algorithm for linear programming
• A projective simplex method for linear programming
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A generalized dual phase-2 simplex algorithm.
• A projective simplex algorithm using LU decomposition

zbMATH Keywords

least squares problemdual crash heuristicNETLIBprojective simplex method

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

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

Cited In (20)

• Title not available (Why is that?)
• A solution comparison for dual angular linear programs
• Efficiency of the dual simplex method for solving systems of linear inequalities
• The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
• Dual-primal algorithm for linear optimization
• A projective simplex algorithm using LU decomposition
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• Direct-dual block method of linear programming
• A Lagrangean dual-based solution method for a special linear programming problem
• An affine-scaling pivot algorithm for linear programming
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A combined phase I-phase II projective algorithm for linear programming
• A phase-1 approach for the generalized simplex algorithm
• A dual projective pivot algorithm for linear programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
• A primal deficient-basis simplex algorithm for linear programming
• Restricted vertex generation applied as a crashing procedure for linear programming

Uses Software

• DEVEX
• NETLIB LP Test Set

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

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