METODE PEMECAHAN MASALAH INTEGER PROGRAMMING
DOI:
https://doi.org/10.21580/at.v7i2.1203Keywords:
integer linier programming, Cutting Plane Algorithm, Branch and BoundAbstract
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.Downloads
Downloads
Published
Issue
Section
License
The copyright of the received article shall be assigned to the journal as the publisher of the journal. The intended copyright includes the right to publish the article in various forms (including reprints). The journal maintains the publishing rights to the published articles. Therefore, the author must submit a statement of the Copyright Transfer Agreement.*)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
In line with the license, authors and third parties (readers, researchers, and others) are allowed to share and adapt the material. In addition, the material must be given appropriate credit, provided with a link to the license, and indicated if changes were made. If authors remix, transform or build upon the material, authors must distribute their contributions under the same license as the original.
________
*) Authors whose articles are accepted for publication will receive confirmation via email and send a Copyright Transfer Agreement.
