Faisal Alawi, Faisal (1210701016) (2015) Linear Programming Using Alternative Approach to Revised Simplex Method and Modified Hungarian Method. Diploma thesis, UIN Sunan Gunung Djati Bandung.
|
Text (COVER)
1_cover.pdf Download (131kB) | Preview |
|
|
Text (ABSTRAK)
2_abstrak.pdf Download (132kB) | Preview |
|
|
Text (DAFTAR ISI)
3_daftarisi.pdf Download (135kB) | Preview |
|
|
Text (BAB I)
4_bab1.pdf Download (213kB) | Preview |
|
![[img]](https://etheses.uinsgd.ac.id/style/images/fileicons/text.png) |
Text (BAB II)
5_bab2.pdf Restricted to Registered users only Download (453kB) |
|
|
Text (BAB III)
6_bab3.pdf Restricted to Registered users only Download (620kB) |
|
|
Text (BAB IV)
7_bab4.pdf Restricted to Registered users only Download (507kB) |
|
|
Text (BAB V)
8_bab5.pdf Restricted to Registered users only Download (213kB) |
|
|
Text (DAFTAR PUSTAKA)
9_daftarpustaka.pdf Restricted to Registered users only Download (301kB) |
Abstract
Linear programming is a mathematical methods to resolve problems allocate limited resources to achieve a destinations like to maximize profits and minimize costs. One of the methods to resolve linear programming problems is alternative approach to revised simplex method. This method is modification of the revised simplex method when this method change how selecting entering variable. Travelling salesman problem is special case from linear programming where this problem is to find travel route most nearby or fasterst from city of origin to multiple destinations and then back to town early with the provisions visited destination city only once. One of the method to resolve travelling salesman problem is modified hungarian method. In final project will use alternatif approach to resived simplex method to determine the maximum profit and modified hungarian method to determine travel route with most faster. Based on a case study with the data as much as ten cities with use alternatif approach to resived simplex method obtained profits Rp 3.059.762,,00 and use modified hungarian method obtained travel route most faster is Bandung→Kuningan→ Tangerang→Jakarta→Bekasi→Karawang→Bogor→Cirebon→Sukabumi→Cianjur→Bandung with 1456 minutes or 24 hours 16 minutes.
| Item Type: | Thesis (Diploma) |
|---|---|
| Uncontrolled Keywords: | Linear programming, simplex method, revised simplex method, graph hamilton, travelling salesman problem |
| Subjects: | Mathematics Analysis, Theory of Functions > Analysis and Calculus Applied mathematics > Programming Mathematics |
| Divisions: | Fakultas Sains dan Teknologi > Program Studi Matematika |
| Depositing User: | Users 234 not found. |
| Date Deposited: | 01 Feb 2017 06:10 |
| Last Modified: | 10 Feb 2017 11:16 |
| URI: | https://etheses.uinsgd.ac.id/id/eprint/2839 |
Actions (login required)
 |
View Item |
