Show simple item record

dc.contributor.advisorSilalahi, Bib Paruhum
dc.contributor.advisorIlyas, Muhammad
dc.contributor.authorMaedianengsih, Rini
dc.date.accessioned2013-06-17T08:21:16Z
dc.date.available2013-06-17T08:21:16Z
dc.date.issued2013
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/64133
dc.description.abstractPrimal-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.en
dc.subjectBogor Agricultural University (IPB)en
dc.subjectcomplexity of the algorithm.en
dc.subjectfull-Newton stepen
dc.subjectinterior methoden
dc.titleAnalisis Kompleksitas Masalah Optimasi Linear Menggunakan Metode Interior Primal-Dual dengan Langkah Full-Newton.en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record