Metode Branch and Cut untuk Menyelesaikan  Multi-Objective Integer Programming

dc.contributor.advisor	Sawaluddin
dc.contributor.advisor	Tarigan, Gim
dc.contributor.author	Amalia, Rizkika
dc.date.accessioned	2022-12-27T05:06:46Z
dc.date.available	2022-12-27T05:06:46Z
dc.date.issued	2014
dc.identifier.uri	https://repositori.usu.ac.id/handle/123456789/78126
dc.description.abstract	BRANCH AND CUT METHOD FOR SOLVING MULTI OBJECTIVE INTEGER PROGRAMMING ABSTRACT Branch and Cut method is a kind of technique for solving linear programming problem which expect integer for its decision variable, but it usually use to solve a single objective integer programming form. In this paper, the author will show how Branch and Cut method can solve a multi-objective integer programming or so-called goal programming. The author also used LINDO (Linear Discrete Optimization). Keywords: Branch and Cut, Multi-Objective Integer Programming, goal programming.	en_US
dc.language.iso	id	en_US
dc.publisher	Universitas Sumatera Utara	en_US
dc.subject	Branch and Cut	en_US
dc.subject	Multi-Objective Integer Programming	en_US
dc.subject	goal programming	en_US
dc.title	Metode Branch and Cut untuk Menyelesaikan Multi-Objective Integer Programming	en_US
dc.identifier.nim	NIM100803037
dc.identifier.nidn	NIDN0031125982
dc.identifier.nidn	NIDN0002025505
dc.identifier.kodeprodi	KODEPRODI44201#Matematika
dc.description.pages	57 Halaman	en_US
dc.description.type	Skripsi Sarjana	en_US