A new linear programming algorithm - better or worse than the simplex method?
type: Item
instance of: scholarly article
title: A new linear programming algorithm - better or worse than the simplex method?
zbMATH Open document ID: 0463.90065
DOI: 10.1007/BF03023055
published in: The Mathematical Intelligencer
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3726088
zbMATH Keywords: simplex method
zbMATH Keywords: optimality condition
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: well- characterized problem
zbMATH Keywords: duality
zbMATH Keywords: supervisor principle
zbMATH Keywords: ellipsoid algorithm
MaRDI profile type: Publication
cites work: Q3258698
cites work: Q5668821
cites work: Q5808752
cites work: Paths, Trees, and Flowers
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q4097094
cites work: Q4051879
cites work: On the Shannon capacity of a graph
cites work: Riemann's hypothesis and tests for primality
cites work: Convergence rate of the gradient descent method with dilatation of the space
cites work: The Factorization of Linear Graphs
author: László Lovász
description: scientific article; zbMATH DE number 3726088