On Implementing a Two-Step Interior Point Method for Solving Linear Programs

A new two-step interior point method for solving linear programs is presented. The technique uses a convex combination of the auxiliary and central points to compute the search direction. To update the central point, we find the best value for step size such that the feasibility condition is held. S...

Full description

Bibliographic Details
Main Authors: Sajad Fathi Hafshejani, Daya Gaur, Robert Benkoczi
Format: Article
Language:English
Published: MDPI AG 2024-07-01
Series:Algorithms
Subjects:
Online Access:https://www.mdpi.com/1999-4893/17/7/303