Linierisasi Persoalan Kuadratik Biner
dc.contributor.advisor | Tulus, Tulus | |
dc.contributor.advisor | Suwilo, Saib | |
dc.contributor.author | Asbar, Vivi | |
dc.date.accessioned | 2023-07-17T06:45:52Z | |
dc.date.available | 2023-07-17T06:45:52Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://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.iso | id | en_US |
dc.publisher | Universitas Sumatera Utara | en_US |
dc.subject | Binary Quadratic Problem (BQP) | en_US |
dc.subject | Linearization | en_US |
dc.subject | NP-hard | en_US |
dc.subject | SDGs | en_US |
dc.title | Linierisasi Persoalan Kuadratik Biner | en_US |
dc.type | Thesis | en_US |
dc.identifier.nim | NIM107021016 | |
dc.identifier.nidn | NIDN0001096202 | |
dc.identifier.nidn | NIDN0009016402 | |
dc.identifier.kodeprodi | KODEPRODI44101#Matematika | |
dc.description.pages | 42 Halaman | en_US |
dc.description.type | Tesis Magister | en_US |
Files in this item
This item appears in the following Collection(s)
-
Master Theses [412]
Tesis Magister