Analisis Penyelesaian Pada Permasalahan Pure Integer Linear Programming Dengan Menggunakan Metode Branch And Bound Dan Cutting Plane
DOI:
https://doi.org/10.61132/arjuna.v1i5.168Keywords:
Branch and Bound, Cutting Plane, Pure Integer Linear ProgrammingAbstract
The use of the Branch and Bound method has few errors but requires more calculations. Meanwhile, the Cutting Plane method reaches the optimum faster because with the addition of the Gomory constraint it is effective in eliminating continuous solutions. Cutting Plane method is better to use if there are few variables, namely 2 variables. In this study, it is shown how a Pure Integer Linear Programming problem is solved using the branch and bound and cutting plane methods with the problem of variable coefficient constraints on fractions and integers with 4 variables. And it is found that the Branch and Bound method is better used in pure integer linear programming problems with variable coefficients of fractional number constraints. While the Cutting Plane method is better used on the coefficients of integer constraints variables
References
Basriati, S. 2018. Integer Linear Programming Dengan Pendekatan Metode Cutting Plane Dan Branch And Bound Untuk Optimasi Produksi Tahu. Jurnal Sains Matematika dan Statistika. Vol. 4, No. 2, Juli 2018.
Bu’ulolo, F. 2016. Opeasi Riset: Program Linear. Medan: Universitas Sumatera Utara Press.
Dantzig, G.B. and M.N. Tapia. 1997. Linear Programming: 1, Introduction. Spring‐Verlag. New York.
Marulizar, T. 2018. Optimisasi Program Linear Integer Murni Dengan Metode Branch and Bound. TALENTA Conference Series: Science & Technology (ST) Vol. 1 Issue 2, Hal 175-181. Medan.
Maslihah, S. 2015. Metode Pemecahan Masalah Integer Programming. Jurnal at-Taqaddum, Volume 7, Nomor 2.
Mulyono, S. 2004. Riset Operasi. Jakarta: Lembaga Penerbit Fakultas Ekonomi Universitas Indonesia.
Septinauli, D. 2019. Aplikasi Metode Branch and Bound dan Cutting Plane untuk Mengoptimalkan Keuntungan Produksi Keripik Ubi pada UD. Rezeki Baru. Skripsi. Sarjana Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Sumatera Utara.
Siagian, P. 2006. Penelitian Operasional: Teori dan Praktek. Jakarta: Universitas Indonesia (UI-Press)
Sinurat, R. R. 2008. Studi Penyelesaian Problema Mixed Integer Linier Programming Dengan Menggunakan Metode Branch and Cut. Medan: Universitas Sumatera Utara.
Siswanto. 2007. Operation Research. Penerbit Erlangga, Bogor.
Taha, H.A.1996. Riset Operasi (edisi revisi). Jakarta. Indonesia.
Taha, H.A.2007.Operation Research An Introduction. Ed. 8. United States : Pearson Education, Inc.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Jurnal Arjuna : Publikasi Ilmu Pendidikan, Bahasa dan Matematika
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
