LPINT: LP Software Based on the Interior Point Method
Janez Barle, Janez Grad
Abstract
Janez Barle, Janez Grad
Abstract
Karmarkar’s algorithm (Karmarkar 1984) and other interior point methods are now regarded as a competitive methods for solving linear programming (LP) problems. It is therefore worth-while to undertake development of a professional LP software based on some particular interior point method. We describe design and implementation aspects of LPINT, an LP software package which is based on the primal-dual interior point algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Karmarkar’s algorithm (Karmarkar 1984) and other interior point methods are now regarded as a competitive methods for solving linear programming (LP) problems. It is therefore worth-while to undertake development of a professional LP software based on some particular interior point method. We describe design and implementation aspects of LPINT, an LP software package which is based on the primal-dual interior point algorithm.
Key concepts: Interior point method, Linear programming, Point (geometry), Software, Mathematical optimization, Computer science, Software package, Mathematics