METODE PEMECAHAN MASALAH INTEGER PROGRAMMING

Siti Maslikhah*  -  Fakultas Ilmu Tarbiyah dan Keguruan Universitas Islam Negeri Walisongo Semarang, Indonesia

(*) Corresponding Author
DOI: 10.21580/at.v7i2.1203
Decision variables in the problem solving linear programs are often in the form of fractions. In some cases there are specific desires the solution in the form of an integer (integer). Integer solution is obtained by way of rounding does not warrant being in the area of fisibel. To obtain integer solutions, among others, by the method of Cutting Plane Algorithm or Branch and Bound. The advantages of the method of Cutting Plane Algorithm is quite effectively shorten the matter, while the advantages of the method of Branch and Bound the error level is to have a little but requires quite a long calculation.

Keywords: integer linier programming; Cutting Plane Algorithm; Branch and Bound

Open Access Copyright (c) 2017 At-Taqaddum : Jurnal Peningkatan Mutu Keilmuan dan Kependidikan Islam

At-Taqaddum
Published by Lembaga Penjaminan Mutu
Universitas Islam Negeri (UIN) Walisongo Semarang
Jl. Walisongo No.3-5 Semarang 50185, Indonesia
Phone: +62 857-1999-1679
Website: https://lpm.walisongo.ac.id/
Email: attaqaddum@walisongo.ac.id 
 
ISSN: 1979-4703 (p)
ISSN: 2527-9726 (e)
DOI : 10.21580/at

Lisensi Creative Commons
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 
apps