A triangulation and fill-reducing initialization procedure for the simplex algorithm
type: Item
instance of: scholarly article
title: A triangulation and fill-reducing initialization procedure for the simplex algorithm
zbMATH Open document ID: 1477.90038
author: Nikolaos Ploskas
author: Nikolaos V. Sahinidis
author: Nikolaos Samaras
published in: Mathematical Programming Computation
publication date: 2021-12-27T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7450837
zbMATH Keywords: linear programming
zbMATH Keywords: revised simplex algorithm
zbMATH Keywords: initial basis
zbMATH Keywords: crash procedure
describes a project that uses: COLAMD
describes a project that uses: CPLEX
describes a project that uses: SuiteSparseQR
describes a project that uses: MINOS
describes a project that uses: MarPlex
describes a project that uses: Matlab
describes a project that uses: METIS
MaRDI profile type: Publication
full work available at URL: s12532-020-00188-1
OpenAlex ID: W3037731493
cites work: Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
cites work: An Approximate Minimum Degree Ordering Algorithm
cites work: Presolving in linear programming
cites work: Implementing the Simplex Method: The Initial Basis
cites work: Q3323698
cites work: On the Automatic Scaling of Matrices for Gaussian Elimination
cites work: Programming of Interdependent Activities: II Mathematical Model
cites work: Q3844775
cites work: Algorithm 915, SuiteSparseQR
cites work: A column approximate minimum degree ordering algorithm
cites work: Algorithm 836
cites work: Benchmarking optimization software with performance profiles.
cites work: Scaling linear optimization problems prior to application of the simplex method
cites work: A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: Sparse Matrices in MATLAB: Design and Implementation
cites work: On the Bartels—Golub decomposition for linear programming bases
cites work: New crash procedures for large systems of linear constraints
cites work: Preprocessing for quadratic programming
cites work: Creating advanced bases for large scale linear programs exploiting embedded network structure
cites work: Pivot selection methods of the Devex LP code
cites work: Parallelizing the dual revised simplex method
cites work: An improved initial basis for the simplex algorithm
cites work: Q5768822
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: Q3137912
cites work: An efficient search direction for linear programming problems
cites work: The elimination form of the inverse and its application to linear programming
cites work: Computational techniques of the simplex method
cites work: Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
cites work: Advanced preprocessing techniques for linear and quadratic programming
cites work: An overview on the simplex algorithm
cites work: Algebraic simplex initialization combined with the nonfeasible basis method
cites work: Linear Programming Computation
cites work: Q4217266
cites work: Pivoting rules for the revised simplex algorithm
cites work: A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
cites work: Pivot rules for linear programming: A survey on recent theoretical developments
cites work: Q4136440
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Eliminating columns in the simplex method for linear programming
DOI: 10.1007/S12532-020-00188-1
Recommended article: A New Triangulation for Simplicial Algorithms
Recommended article: On the simplex algorithm initializing
Recommended article: An improved initial basis for the simplex algorithm
Recommended article: Simplicial algorithms for minimizing polyhedral functions
Recommended article: Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
Recommended article: An algorithmic approach to simultaneous triangularization
Recommended article: A Simplicial Algorithm for Stationary Point Problems on Polytopes
Recommended article: A Lower Bound Technique for Triangulations of Simplotopes
Recommended article: Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
Recommended article: A contribution to triangulation algorithms for simple polygons