A basis-defiency-allowing variation of the simplex method for linear programming

DOI10.1016/S0898-1221(98)00127-8zbMath0941.90055MaRDI QIDQ1806578

Ping-Qi Pan

Publication date: 8 November 1999

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

zbMATH Keywords

linear programmingdegeneracyleast squares problemsimplex methodorthogonal transformationbasis deficiency

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (22)

A phase-1 approach for the generalized simplex algorithm ⋮ A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ The positive edge criterion within COIN-OR's CLP ⋮ A dual projective simplex method for linear programming ⋮ A projective simplex algorithm using LU decomposition ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ Efficient nested pricing in the simplex algorithm ⋮ A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule ⋮ Book review of: P.-Q. Pan, Linear programming computation ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ Stabilized dynamic constraint aggregation for solving set partitioning problems ⋮ Multi-phase dynamic constraint aggregation for set partitioning type problems ⋮ Phase I cycling under the most-obtuse-angle pivot rule ⋮ A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming ⋮ An interesting characteristic of phase-1 of dual–primal algorithm for linear programming ⋮ Column generation decomposition with the degenerate constraints in the subproblem ⋮ A new version of the improved primal simplex for degenerate linear programs ⋮ Sensitivity analysis of the optimal assignment. ⋮ Combined projected gradient algorithm for linear programming ⋮ A hybrid direction algorithm for solving linear programs ⋮ An affine-scaling pivot algorithm for linear programming ⋮ Row-reduced column generation for degenerate master problems

Uses Software

• SCICONIC
• DEVEX

Cites Work

• Practical finite pivoting rules for the simplex method
• A dual approach to primal degeneracy
• 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
• Steepest-edge simplex algorithms for linear programming
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• A practicable steepest-edge simplex algorithm
• 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
• A Variant of the Dual Pivoting Rule in Linear Programming
• Programming of Interdependent Activities: II Mathematical Model
• Optimality and Degeneracy in Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A basis-defiency-allowing variation of the simplex method for linear programming