Evaluation of interior-point method in Scilab
Bib Paruhum Silalahi
Abstract
Open-access reader
Bib Paruhum Silalahi
Abstract
Open-access reader
The interior-point method is one of the best methods for solving linear programming problems. The interior-point method has a polynomial time complexity for solving linear programming problems. Next, Scilab as a free source software provides a function to solve linear programming based on interior-point method, which is called Karmarkar. In this paper, we evaluate some results of Scilab Karmarkar function in solving linear programming problems. We observe that at some cases the results of the Karmarkar function are not as expected.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
The interior-point method is one of the best methods for solving linear programming problems. The interior-point method has a polynomial time complexity for solving linear programming problems. Next, Scilab as a free source software provides a function to solve linear programming based on interior-point method, which is called Karmarkar. In this paper, we evaluate some results of Scilab Karmarkar function in solving linear programming problems. We observe that at some cases the results of the Karmarkar function are not as expected.
Key concepts: Interior point method, Linear programming, Linear-fractional programming, Point (geometry), Function (biology), Computer science, Mathematical optimization, Mathematics