Loading...
Please wait, while we are loading the content...
Similar Documents
Perbandingan Metode Simpleks Dengan Algoritma Titik Interior Dalam Penyelesaian Masalah Program Linier
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sitorus, Agustina Anggreini |
| Copyright Year | 2016 |
| Abstract | Linear programming is a program which involved function and can be used in solving problem of limited source allocation optimally. The main ideas used in linear program is defining problem of information provided and transforming into mathematical model. Simpleks method is one of effisient algorithm for solving problem of linear programming. Interior point algorithm is a new means which can be used to solve these great problems. The objective of this paper is solving linear programming problem which contain n variables and m constaints using those two methods, then comparing how efficient method are, by counting the number of iteration for each methods. Based on the result, linear programming problem by the simpleks method will result if and the interior point algorithm results obtained when the value of is equal to the previous value or smaller. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://repository.usu.ac.id/bitstream/handle/123456789/62867/Cover.pdf?isAllowed=y&sequence=6 |
| Alternate Webpage(s) | http://repository.usu.ac.id/bitstream/handle/123456789/62867/Abstract.pdf?isAllowed=y&sequence=5 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
