A degeneracy exploiting LU factorization for the simplex method

No abstract is available for this paper.

• Publication year

  1980

• Venue

  Mathematical programming

• Publication date

  1980-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BF01581646
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Bipartite graphs and an optimal bordered triangular form of a matrix

  1979cited by this paper
• A Basis Factorization Method for Block Triangular Linear Programs.

  1978cited by this paper
• MINOS System Manual.

  1977cited by this paper
• MINOS. A Large-Scale Nonlinear Programming System (For Problems With Linear Constraints). User's Guide.

  1977cited by this paper
• New Finite Pivoting Rules for the Simplex Method

  1977cited by this paper
• A practicable steepest-edge simplex algorithm

  1977cited by this paper
• FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX

  1976cited by this paper
• A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING

  1976cited by this paper
• Pivot selection methods of the Devex LP code

  1973cited by this paper
• Sparse matrices and their applications

  1972cited by this paper
• The Partitioned Preassigned Pivot Procedure (P4)

  1972cited by this paper
• Reinversion with the preassigned pivot procedure

  1971cited by this paper
• Numerical techniques in mathematical programming

  1970cited by this paper
• Advanced Linear-Programming Computing Techniques

  1968cited by this paper
• Linear programming and extensions

  1965cited by this paper
• The Elimination form of the Inverse and its Application to Linear Programming

  1957cited by this paper

• Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis

  2014cites this paper
• Reduced Simplex Method

  2014cites this paper
• Generalizing Reduced Simplex Method

  2014cites this paper
• Variants of the Simplex Method

  2014cites this paper
• Dual Face Method

  2014cites this paper
• Integer Linear Programming (ILP)

  2014cites this paper
• Geometry of the Feasible Region

  2014cites this paper
• Sensitivity Analysis and Parametric LP

  2014cites this paper
• Dual Deficient-Basis Method

  2014cites this paper
• A linear programming decomposition focusing on the span of the nondegenerate columns

  2014cites this paper
• Les Cahiers du GERAD CITATION ORIGINALE / ORIGINAL CITATION

  2014cites this paper
• Implementation of the Simplex Method

  2014cites this paper
• Interior-Point Method

  2014cites this paper
• Simplex Phase-I Method

  2014cites this paper
• Duality Principle and Dual Simplex Method

  2014cites this paper
• Deficient-Basis Method

  2014cites this paper
• Improved Reduced Simplex Method

  2014cites this paper
• Dual Pivot Rule

  2014cites this paper
• Pivotal Interior-Point Method

  2014cites this paper
• Criss-Cross Simplex Method

  2014cites this paper
• Dual Simplex Phase-l Method

  2014cites this paper
• Tools for primal degenerate linear programs: IPS, DCA, and PE

  2013cites this paper
• A review of the LU update in the simplex algorithm

  2012cites this paper
• Computational experience with linear optimization and related problems

  2010cites this paper
• LP and related approaches in forest planning

  1990cites this paper
• Linear programming and related approaches in forest planning.

  1990cites this paper
• On the solution of highly degenerate linear programmes

  1988cites this paper
• An Algorithm for Minimizing Polyhedral Convex Functions

  1983cites this paper
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases

  1982cites this paper