A path-following version of the Todd-Burrell procedure for linear programming
type: Item
instance of: scholarly article
title: A path-following version of the Todd-Burrell procedure for linear programming
zbMATH Open document ID: 0889.90112
DOI: 10.1007/BF01217688
author: Jean-Philippe Vial
published in: Mathematical Methods of Operations Research
publication date: 1997-12-10T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1095979
zbMATH Keywords: projective algorithm
zbMATH Keywords: path-following
zbMATH Keywords: interior point method
MaRDI profile type: Publication
cites work: A monotonic projective algorithm for fractional linear programming
cites work: A polynomial Newton method for linear programming
cites work: A survey of search directions in interior point methods for linear programming
cites work: Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3491304
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: A Path-Following Projective Interior Point Method for Linear Programming
cites work: An extension of Karmarkar's algorithm for linear programming using dual variables
full work available at URL: https://doi.org/10.1007/bf01217688
OpenAlex ID: W2085811669
description: scientific article; zbMATH DE number 1095979