Comparison of Interior Point Method Execution Time in Solving Linear Optimization Problems using MATHEMATICA and SCILAB
Linear optimization is part of optimization where the objective function is linear and all of the constraints are in linear forms. An efficient method for solving linear optimization is called Interior Point Method. In this paper, we present the execution time of linear optimization
problems using the Interior Point Method in Mathematica and Scilab. Then we compare the results.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.