An exterior point simplex algorithm for (general) linear programming problems
type: Item
instance of: scholarly article
title: An exterior point simplex algorithm for (general) linear programming problems
zbMATH Open document ID: 0786.90043
DOI: 10.1007/BF02023111
author: Konstantinos Paparrizos
published in: Annals of Operations Research
publication date: 1994-02-07T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 495362
zbMATH Keywords: degeneracy
zbMATH Keywords: cycling-free pivoting rules
zbMATH Keywords: exterior point simplex type algorithm
MaRDI profile type: Publication
cites work: Q4188659
cites work: Q3229788
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
cites work: Q5618274
cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement
cites work: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
cites work: Q4051879
cites work: Q5519710
cites work: Q5336851
cites work: Computational complexity of parametric linear programming
cites work: Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
cites work: An infeasible (exterior point) simplex algorithm for assignment problems
cites work: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
cites work: A convergent criss-cross method
cites work: On anti-cycling pivoting rules for the simplex method
full work available at URL: https://doi.org/10.1007/bf02023111
OpenAlex ID: W2057085806
description: scientific article; zbMATH DE number 495362