Record Details

METODE PEMECAHAN MASALAH INTEGER PROGRAMMING

At-Taqaddum

View Archive Info
 
 
Field Value
 
Title METODE PEMECAHAN MASALAH INTEGER PROGRAMMING
 
Creator Maslikhah, Siti
 
Subject integer linier programming; Cutting Plane Algorithm; Branch and Bound
 
Description 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.
 
Publisher Quality Assurance Institute (LPM) State Islamic University Walisongo Semarang
 
Contributor —
 
Date 2017-02-06
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier https://journal.walisongo.ac.id/index.php/attaqaddum/article/view/1203
10.21580/at.v7i2.1203
 
Source At-Taqaddum; Volume 7, Nomor 2, November 2015; 211-226
2527-9726
1979-4703
 
Language eng
 
Relation https://journal.walisongo.ac.id/index.php/attaqaddum/article/view/1203/946
 
Rights Copyright (c) 2017 At-Taqaddum : Jurnal Peningkatan Mutu Keilmuan dan Kependidikan Islam