Perbandingan Waktu Penyelesaian Masalah Optimalisasi Linear Antara Metode Simpleks Dan Metode Interior Dengan Menggunakan Perangkat Lunak Mathematica

Abstract

This paper presents time comparison between the use of simplex method and interior point method in solving linear optimization problems. The examination was done towards several linear optimization problems. with the help of mathematical software. Mathematica. The chosen size of linear optimization problems vary from small to relatively big. The main result is that the interior point method is faster than the simplex method in solving big size linear optimization problems.