The \(s\)-monotone index selection rules for pivot algorithms of linear programming
type: Item
instance of: scholarly article
title: The \(s\)-monotone index selection rules for pivot algorithms of linear programming
zbMATH Open document ID: 1253.90164
author: Zsolt Csizmadia
author: Tibor Illés
author: Adrienn Nagy
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C49
zbMATH DE Number: 6119466
zbMATH Keywords: linear programming problem
zbMATH Keywords: pivot algorithms
zbMATH Keywords: anti-cycling pivot rules
zbMATH Keywords: \(s\)-monotone index selection rules
zbMATH Keywords: \texttt{MATLAB}
describes a project that uses: Matlab
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.02.008
OpenAlex ID: W2124873042
cites work: A Monotonic Build-Up Simplex Algorithm for Linear Programming
cites work: Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Q4079613
cites work: Q3844775
cites work: Q4435041
cites work: Pivot versus interior point methods: Pros and cons
cites work: The role of pivoting in proving some fundamental theorems of linear algebra
cites work: Q4039868
cites work: Q3706831
cites work: A convergent criss-cross method
cites work: Pivot rules for linear programming: A survey on recent theoretical developments
cites work: New variants of finite criss-cross pivot algorithms for linear programming
cites work: The Criss-Cross Method for Solving Linear Programming Problems
DOI: 10.1016/J.EJOR.2012.02.008
description: scientific article; zbMATH DE number 6119466