A polynomial projection algorithm for linear feasibility problems
type: Item
instance of: scholarly article
title: A polynomial projection algorithm for linear feasibility problems
zbMATH Open document ID: 1327.90102
author: Sergei Chubanov
published in: Mathematical Programming. Series A. Series B
publication date: 2015-10-19T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6495766
zbMATH Keywords: linear programming
zbMATH Keywords: systems of linear inequalities
zbMATH Keywords: polynomial algorithm
describes a project that uses: LIPSOL
MaRDI profile type: Publication
full work available at URL: s10107-014-0823-8
OpenAlex ID: W2040392433
cites work: The Relaxation Method for Linear Inequalities
cites work: A strongly polynomial algorithm for linear systems having a binary solution
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Systems of distinct representatives and linear algebra
cites work: The Relaxation Method for Solving Systems of Linear Inequalities
cites work: On the non-polynomiality of the relaxation method for systems of linear inequalities
cites work: Updating the Inverse of a Matrix
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3050157
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: The many facets of linear programming
DOI: 10.1007/S10107-014-0823-8
description: scientific article; zbMATH DE number 6495766