Achievable potential reductions in the method of Kojima et al. in the case of linear programming

DOI10.1051/ro/1994280201231zbMath0860.90087OpenAlexW2280860690MaRDI QIDQ4887124

Jean-Philippe Vial, Cornelis Roos

Publication date: 21 April 1997

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105078

zbMATH Keywords

linear complementarityduality gapprimal-dual interior point methodpotential reduction

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A new linesearch method for quadratically constrained convex programming ⋮ Consistency, redundancy, and implied equalities in linear systems

This page was built for publication: Achievable potential reductions in the method of Kojima et al. in the case of linear programming