Fikry, Nidzam (2018) Pemyelesaian Linear Programming dengan Metode Revised Simplex. Sarjana thesis, Universitas Brawijaya.
Abstract
Pada umumnya permasalahan linear programming hanya diselesaikan dengan menggunakan metode simpleks. Pada penelitian ini bertujuan mengenalkan metode revised simplex dalam menyelesaikan masalah linear programming. Revised simplex dikerjakan dengan menggunakan invers matriks basis untuk mencari kolom pivot dan hasil optimasi. Perbedaan metode simpleks dan revised simplex adalah banyaknya perhitungan dalam anggota non-basis.
English Abstract
In general, linear programming problem solving is using simplex method. The purpose of this research is to introduce revised simplex method in linear programming problem solving. Revised simplex is done by using basic inverse matrix to find pivot column and optimation result. The difference of simplex and revised simplex method is the number of calculation in non-basic components.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/MIPA/2018/542/051901793 |
| Uncontrolled Keywords: | Simpleks, Revised Simplex, Linear Programming |
| Subjects: | 500 Natural sciences and mathematics > 519 Probabilities and applied mathematics > 519.7 Programming |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika |
| Depositing User: | Endang Susworini |
| Date Deposited: | 06 Jun 2020 10:30 |
| Last Modified: | 06 Jun 2020 10:30 |
| URI: | http://repository.ub.ac.id/id/eprint/168868 |
Actions (login required)
 |
View Item |