PRIMAL PROGRAM LINEAR MENGGUNAKAN ALGORITMA INTERIOR POINT DAN METODE SIMPLEX
ABSTRACT: Primal linear
programing in of section by operation reseach, “The obyective of Interior Point
algoritm and Simplex Methods to make Solution in primal linear programing", simplex method could be formulated to be interior
point algoritm linear programing with MatLab basic program to get optimal
solution of linear programing obyektif function.
Analysis of interior point algoritm by Narendra Karmarkar (1984) from AT.
ET. Bell are used interior point choice in feasible region, alpha criteria and
primal-dual of linear programing. This study interior point algoritm in primal linear programing solution also
makes to simplex method by George Dantzig (1947) solution in linear
programing. Interior point algoritm in primal linear programing solution the
fastest five hundred of Simplex method,
this news the best of The New York
Times.
Penulis: Rusdy Agustaf
Kode Jurnal: jptmesindd110193
