An efficient simplex type algorithm for sparse and dense linear programs.

DOI10.1016/S0377-2217(02)00400-9zbMATH Open1035.90041OpenAlexW2094456378MaRDI QIDQ1810522FDOQ1810522

Authors: Konstantinos Paparrizos, Nikolaos Samaras, George Stephanides 

Publication date: 9 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00400-9

Recommendations

• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• scientific article; zbMATH DE number 3852786
• scientific article; zbMATH DE number 710572
• scientific article; zbMATH DE number 5182668
• An exterior point simplex algorithm for (general) linear programming problems

zbMATH Keywords

evaluationAlgorithmNumerical experimentsLinear programmingBig-\(M\) methodSimplex type algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Cites Work

• Title not available (Why is that?)
• Sparse Matrix Methods in Optimization
• Sparse Matrices in MATLAB: Design and Implementation
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• Steepest-edge simplex algorithms for linear programming
• Title not available (Why is that?)
• Distributed Schur Complement Techniques for General Sparse Linear Systems
• Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Commentary—Progress in Linear Programming
• The generalized simplex method
• An exterior point simplex algorithm for (general) linear programming problems
• The simplex algorithm with a new primal and dual pivot rule
• Title not available (Why is that?)
• An infeasible (exterior point) simplex algorithm for assignment problems
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• Title not available (Why is that?)
• Worst case behavior of the steepest edge simplex method
• Title not available (Why is that?)
• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples

Cited In (11)

• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• Deepest point of a polyhedron and linear programming
• A two-phase support method for solving linear programs: numerical experiments
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Improving a primal–dual simplex-type algorithm using interior point methods
• Exterior point simplex-type algorithms for linear and network optimization problems
• An improved initial basis for the simplex algorithm
• An experimental investigation of a primal-dual exterior point simplexalgorithm
• A new efficient primal dual simplex algorithm
• Efficient GPU-based implementations of simplex type algorithms
• A hybrid direction algorithm for solving linear programs

Uses Software

• Matlab
• symrcm

This page was built for publication: An efficient simplex type algorithm for sparse and dense linear programs.

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