An improving procedure of the interior projective method for linear programming

DOI10.1016/j.amc.2007.10.014zbMath1143.65045OpenAlexW2009640439MaRDI QIDQ928104

Djamel Benterki, Assma Leulmi

Publication date: 11 June 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.014

zbMATH Keywords

numerical examplesinterior point methodsKarmarkar's algorithmYe-Lustig algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

A primal-dual interior-point method based on various selections of displacement step for symmetric optimization

Cites Work

• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• A modified algorithm for the strict feasibility problem
• Unnamed Item

This page was built for publication: An improving procedure of the interior projective method for linear programming