Show simple item record

dc.contributor.advisorTulus, Tulus
dc.contributor.advisorSuwilo, Saib
dc.contributor.authorAsbar, Vivi
dc.date.accessioned2023-07-17T06:45:52Z
dc.date.available2023-07-17T06:45:52Z
dc.date.issued2012
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/85913
dc.description.abstract Optimization problem is a part of everyday life problems. Most of them are things related to integer programming, particularly in Binary Quadratic Problem (BQP), where the formula is not linear either in the target function or the function using nonlinear optimization method or using specific method to do linear optimization, but the formula needs to be simplified to get a linear optimization. At the beginning, the linearization technique is designed for quadratic tasks, but then, since linearization is part of a large class the linearization technique can be applied to Binary Quadratic matters with problems in tasking. Thus, it is possible to figure out a specific linearization that can solve the problems in a simple way.en_US
dc.language.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectBinary Quadratic Problem (BQP)en_US
dc.subjectLinearizationen_US
dc.subjectNP-harden_US
dc.subjectSDGsen_US
dc.titleLinierisasi Persoalan Kuadratik Bineren_US
dc.typeThesisen_US
dc.identifier.nimNIM107021016
dc.identifier.nidnNIDN0001096202
dc.identifier.nidnNIDN0009016402
dc.identifier.kodeprodiKODEPRODI44101#Matematika
dc.description.pages42 Halamanen_US
dc.description.typeTesis Magisteren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record