On relaxation methods for systems of linear inequalities
type: Item
instance of: scholarly article
title: On relaxation methods for systems of linear inequalities
zbMATH Open document ID: 0476.65041
DOI: 10.1016/0377-2217(82)90071-6
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3748325
zbMATH Keywords: relaxation methods
zbMATH Keywords: feasible solution
zbMATH Keywords: polynomially bounded algorithm
zbMATH Keywords: Khachian's algorithm
author: Jan Telgen
MaRDI profile type: Publication
full work available at URL: 0377-2217(82)90071-6
OpenAlex ID: W1999437445
cites work: The Relaxation Method for Linear Inequalities
cites work: Q4773298
cites work: Q3214098
cites work: Q5520839
cites work: Q5730421
cites work: Khachiyan’s algorithm for linear programming
cites work: Q4198056
cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement
cites work: On defining sets of vertices of the hypercube by linear inequalities
cites work: Q4197641
cites work: Q4051879
cites work: Gradient methods for solving equations and inequalities
cites work: The complexity of linear programming
cites work: Q3929386
cites work: A bad network problem for the simplex method and other minimum cost flow algorithms
description: scientific article; zbMATH DE number 3748325