Open AccessMETODE PEMECAHAN MASALAH INTEGER PROGRAMMING
Author(s) -
Siti Maslikhah
Publication year - 2017
Publication title -
at-taqaddum
Language(s) - English
Resource type - Journals
ISSN - 2527-9726
DOI - 10.21580/at.v7i2.1203
Subject(s) - rounding , cutting plane method , integer programming , mathematics , integer (computer science) , branch and cut , branch and price , plane (geometry) , mathematical optimization , computer science , geometry , programming language , operating system
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.