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

DOI10.1016/S0898-1221(98)00127-8MaRDI QIDQ1806578zbMATH OpenFDO

Authors Ping-Qi Pan

Publication date 8 November 1999

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

Full work available at URL https://doi.org/10.1016/S0898-1221(98)00127-8

zbMATH Keywords

linear programmingdegeneracyleast squares problemorthogonal transformationsimplex methodbasis deficiency

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A primal deficient-basis simplex algorithm for linear programming
• scientific article; zbMATH DE number 3852781
• A phase-1 approach for the generalized simplex algorithm
• scientific article; zbMATH DE number 1064823
• Partial pricing rule simplex method with deficient basis

Cites work

• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• scientific article; zbMATH DE number 3115468 (Why is no real title available?)
• scientific article; zbMATH DE number 3956805 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 193993 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• scientific article; zbMATH DE number 3614492 (Why is no real title available?)
• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• scientific article; zbMATH DE number 883252 (Why is no real title available?)
• scientific article; zbMATH DE number 910295 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• A Variant of the Dual Pivoting Rule in Linear Programming
• A dual approach to primal degeneracy
• A dual projective simplex method for linear programming
• A practicable steepest-edge simplex algorithm
• A practical anti-cycling procedure for linearly constrained optimization
• A simplex-like method with bisection for linear programming¹
• New Finite Pivoting Rules for the Simplex Method
• Optimality and Degeneracy in Linear Programming
• Practical finite pivoting rules for the simplex method
• Programming of Interdependent Activities: II Mathematical Model
• Steepest-edge simplex algorithms for linear programming
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study

Cited in

(25)

• Sensitivity analysis of the optimal assignment.
• Combined projected gradient algorithm for linear programming
• Partial pricing rule simplex method with deficient basis
• 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
• Efficient nested pricing in the simplex algorithm
• Book review of: P.-Q. Pan, Linear programming computation
• An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
• An affine-scaling pivot algorithm for linear programming
• 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 new version of the improved primal simplex for degenerate linear programs
• scientific article; zbMATH DE number 847181 (Why is no real title available?)
• A note on ``An improved initial basis for the simplex algorithm
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Phase I cycling under the most-obtuse-angle pivot rule
• Column generation decomposition with the degenerate constraints in the subproblem
• A phase-1 approach for the generalized simplex algorithm
• Row-reduced column generation for degenerate master problems
• Stabilized dynamic constraint aggregation for solving set partitioning problems
• A hybrid direction algorithm for solving linear programs
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
• A primal deficient-basis simplex algorithm for linear programming

Describes a project that uses

Uses Software

• DEVEX
• SCICONIC

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

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