A phase-1 approach for the generalized simplex algorithm

DOI10.1016/S0898-1221(01)00254-1zbMath1002.90036WikidataQ127946022 ScholiaQ127946022MaRDI QIDQ1612514

Ping-Qi Pan, Yunpeng Pan

Publication date: 25 August 2002

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

zbMATH Keywords

linear programmingsimplex algorithmdegeneracyLU-decompositiondeficient basisphase-1single artificial variable

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (6)

A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ A method to improve integer linear programming problem with branch-and-bound procedure ⋮ 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 ⋮ Phase I cycling under the most-obtuse-angle pivot rule

Uses Software

• SCICONIC
• DEVEX
• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• A projective simplex method for linear programming
• A dual projective simplex method for linear programming
• A practical anti-cycling procedure for linearly constrained optimization
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• Criss-cross methods: A fresh view on pivot algorithms
• Steepest-edge simplex algorithms for linear programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• A projective simplex algorithm using LU decomposition
• A stabilization of the simplex method
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method
• A simplex-like method with bisection for linear programming¹
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• New Finite Pivoting Rules for the Simplex Method
• The simplex method of linear programming using LU decomposition
• Programming of Interdependent Activities: II Mathematical Model
• Optimality and Degeneracy in Linear Programming

This page was built for publication: A phase-1 approach for the generalized simplex algorithm