Analisis Kompleksitas Masalah Optimasi Linear Menggunakan Metode Interior Primal-Dual dengan Langkah Full-Newton.

Please use this identifier to cite or link to this item: http://repository.ipb.ac.id/handle/123456789/64133

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Silalahi, Bib Paruhum
dc.contributor.advisor	Ilyas, Muhammad
dc.contributor.author	Maedianengsih, Rini
dc.date.accessioned	2013-06-17T08:21:16Z
dc.date.available	2013-06-17T08:21:16Z
dc.date.issued	2013
dc.identifier.uri	http://repository.ipb.ac.id/handle/123456789/64133
dc.description.abstract	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.	en
dc.subject	Bogor Agricultural University (IPB)	en
dc.subject	complexity of the algorithm.	en
dc.subject	full-Newton step	en
dc.subject	interior method	en
dc.title	Analisis Kompleksitas Masalah Optimasi Linear Menggunakan Metode Interior Primal-Dual dengan Langkah Full-Newton.	en
Appears in Collections:	UT - Mathematics

Files in This Item:

File	Description	Size	Format
G13rma.pdf Restricted Access	full text	905.6 kB	Adobe PDF	View/Open

DSpace JSPUI