Analisis Kompleksitas Masalah Optimasi Linear Menggunakan Metode Interior Primal-Dual dengan Langkah Full-Newton.
![Thumbnail](/bitstream/handle/123456789/64133/G13rma.pdf.jpg?sequence=4&isAllowed=n)
View/ Open
Date
2013Author
Maedianengsih, Rini
Silalahi, Bib Paruhum
Ilyas, Muhammad
Metadata
Show full item recordAbstract
Primal-dual interior method with full-Newton step is a method for solving linear optimization problems. This method is designed in such a way that an optimal solution is obtained an interior of the domain. It has polynomial complexity. This paper discusses and analyzes the complexity of linear optimization problems using primal-dual interior method with full-Newton steps. From the case studies that have been conducted, can be concluded that the number of iterations is in accordance with the complexity of the algorithm.
Collections
- UT - Mathematics [1416]