KOMPUTASI METODE SIMPLEKS PADA PENYELESAIAN PROGRAM LINIER

Ahmad Yusuf, Dewi Sri Susanti

Abstract


One of the methods that can be used to solve linear program problem is a simplex method. In this study, researchers will try to make a computational algorithm the simplex method that can be used for the completion of the linear program, so obtained a series of efficient completion processes and optimal end results. This research generate program code Computing using Borland Delphi 6.0 programming language which can be used to solve linear program problems by using simplex method.

Keywords


Linear progamming, Simplex method algorithm

Full Text:

PDF

References


. Alam, M.A.J. 2001. Belajar Sendiri Borland Delphi 6.0. PT. Elex Media

Komputindo, Jakarta.

. Hieller & Lieberman. 1995. Operation Research. McGraw Hill, New Jersey.

. Lawrence, Stephen. 2008. Survey of Operation Research. Dictate of

Engineering Management Program. University of Colorado.

. Siagian, P. 1987. Penelitian Operasional. Universitas Indonesia, Jakarta.

. Supranto, J. 1983. Program Linier. Lembaga Penerbit Fakultas Ekonomi UI, Jakarta.




DOI: https://doi.org/10.20527/epsilon.v4i1.44

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 JURNAL MATEMATIKA MURNI DAN TERAPAN EPSILON

Indexed by: 

      

 

EDITORIAL OFFICE 

           

 

 

 

Creative Commons License
All articles published in "Epsilon: Jurnal Matematika Murni dan Terapan" are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0). Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.