PENYELESAIAN PROGRAM LINEAR DENGAN MENGGUNAKAN METODE SIMPLEKS
| Main Author: | Zulhendri, Zulhendri |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Prodi Pendidikan Matematika Fakultas Ilmu Pendidikan (FIP) Universitas Pahlawan Tuanku Tambusai (UPTT) Riau
, 2016
|
| Online Access: |
http://journal.stkiptam.ac.id/index.php/cendekia/article/view/647 http://journal.stkiptam.ac.id/index.php/cendekia/article/view/647/365 |
Daftar Isi:
- Abstract Linear program is an optimal completion technique on a decision problem by determining in advance the objective function ( maximize or minimize ) and the constraints that exist in the mathematical model of linear equations . A linear programming problem of allocating limited resources optimally can be derived in the form of mathematical models to first define the variables and objectives. Furthermore , mathematical models are solved using the simplex method . The purpose of this study is to construct a mathematical model of linear programming case , can determine the solution of a mathematical model using the simplex method.