A modified algorithm for the strict feasibility problem

DOI10.1051/ro:2001121zbMath1015.90054OpenAlexW2128355901MaRDI QIDQ4546062

Djamel Benterki, Bachir Merikhi

Publication date: 18 August 2002

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

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_4_395_0

zbMATH Keywords

interior point methodsstrict feasibilityYe-Lustig algorithm

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51)

Related Items (3)

Finding a strict feasible solution of a linear semidefinite program ⋮ An improving procedure of the interior projective method for linear programming ⋮ Finding a strict feasible dual solution of a convex optimization problem

Cites Work

• A reduced-gradient variant of Karmarkar's algorithm and null-space projections
• Unnamed Item

This page was built for publication: A modified algorithm for the strict feasibility problem