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

From MaRDI portal
Revision as of 09:16, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1806578

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)




Related Items (22)

A phase-1 approach for the generalized simplex algorithmA linear programming decomposition focusing on the span of the nondegenerate columnsThe positive edge criterion within COIN-OR's CLPA dual projective simplex method for linear programmingA projective simplex algorithm using LU decompositionCriss-cross algorithm based on the most-obtuse-angle rule and deficient basisEfficient nested pricing in the simplex algorithmA basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column ruleBook review of: P.-Q. Pan, Linear programming computationA primal deficient-basis simplex algorithm for linear programmingStabilized dynamic constraint aggregation for solving set partitioning problemsMulti-phase dynamic constraint aggregation for set partitioning type problemsPhase I cycling under the most-obtuse-angle pivot ruleA variant of the dual face algorithm using Gauss-Jordan elimination for linear programmingAn interesting characteristic of phase-1 of dual–primal algorithm for linear programmingColumn generation decomposition with the degenerate constraints in the subproblemA new version of the improved primal simplex for degenerate linear programsSensitivity analysis of the optimal assignment.Combined projected gradient algorithm for linear programmingA hybrid direction algorithm for solving linear programsAn affine-scaling pivot algorithm for linear programmingRow-reduced column generation for degenerate master problems


Uses Software



Cites Work




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