JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Susanto, Sani | |
| dc.contributor.author | Sitompul, Carles | |
| dc.contributor.author | Aritonang, Y.M. Kinley | |
| dc.date.accessioned | 2017-04-10T09:25:39Z | |
| dc.date.available | 2017-04-10T09:25:39Z | |
| dc.date.issued | 2005 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/1349 | |
| dc.description | Jurnal Teknologi Industri;Vol.9 No.2 April 2005 | en_US |
| dc.description.abstract | The effectiveness o f the simplex algorithm in solving Linear Programming problems is already well known and recognized. However, its efficiency is often questioned. This research proposes some modifications to the simplex algorithm, which are aimed at increasing its efficiency. | en_US |
| dc.publisher | Fakultas Teknologi Industri, UAJY | en_US |
| dc.subject | the simplex algorithm, linear programming problem, efficiency, modification, the greatest increase method | en_US |
| dc.title | Peningkatan efisiensi algoritma simpleks : modifikasi dengan metoda kenaikan terbesar | en_US |
| dc.type | Journal Articles | en_US |
