PRIMAL PROGRAM LINEAR MENGGUNAKAN ALGORITMA INTERIOR POINT DAN METODE SIMPLEX

Rusdy Agustaf

Sari


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 Times1.

Keywords :   Interior Point,  Alpha Criteria,  Simplex , Primal linear programing

 


Teks Lengkap:

PDF

Referensi


DAFTAR PUSTAKA

Hillier, Frederick S Gerald J. Lieberman, 1994 , Introduction to Operation Research , McGraw-Hill Publishing Company; New York.

Gondzio, J.,dan Tamas T., 1994, A Computational View of Interior Point Methods for Linear Programming"; University of Geneva 102 Bd Carlvogt, CH-1211 Geneva 4, Switzerland; Delft University of Technology,PO BOX 5031,2600 GA Delft; The Netherlands, internet E-mail: gondzio@divsum.unige.ch; t.terlaky@twi.tudelft.n1.

Roos, K., Tamas Terlaky; Jean-Philippe Vial., 2001, Theory and Algorithms for Linear Optimization An Interior Point Approach,

Accessed by June 2001.

Potra, Florian A.; Ronggin Sheng., 2001., A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm For Semidefinite Programming, The University of Iowa; USA.

Subanar, 2001, Riset Teori, FMIPA-UGM, Yogyakarta.


Refbacks

  • Saat ini tidak ada refbacks.