Application Of Thebranch And Bound In Optimizing The Amount Of Bread Production In CV. Zuhro Bakery Perbaungan

Authors

  • Novita Sari Dewi Universitas Sumatera Utara
  • James Piter Marbun Universitas Sumatera Utara

DOI:

https://doi.org/10.55606/jurrimipa.v2i2.1318

Keywords:

Branch and Bound Method, Simplex Method, Integer Programming, Liniear Programming

Abstract

Zuhro Bakery is baking factory producing various kinds of bread. In this research, there were three kinds of bread that were studied, they were chocolate, mocha and strawberry flavored bread. The problem in optimalization of the production was modeled into a mathematic model which was the linear program in the form obstacle function and objective function. It was then continued by the deciding variable in integer number as the linear program. Then, it was solved by using Branch and Bound method which previously had counted the variable by using the symplex method. From the simplex method, an integer number result was not found, so the Branch and Bound method was used. QM software was chosen in the research to solve the integer problem. A profit was earned with a sale margin of Rp39.000 or 0,42% from the coorporation’s expected profit by using the Branch and Bound method. The amount of bread produced in the periode of three days were 5.400 consosted of 3.060 chocolate flavored bread, 1.440 mocha flavored bread and 900 strawberry flavored bread with the total profit of Rp9.279.000

Downloads

Download data is not yet available.

References

Angeline, Iryanto, Tarigan Gim. “Penerapan Metode Branch And Bound dalam Menentukan Jumlah Produksi Optimum pada CV. XYZ”. Jurnal Saintia Matematika, no 2, pp 137-145. 2004.

Bu’ulӧlӧ, F. Opeasi Riset: Program Linear. Medan: Universitas Sumatera Utara Press. 2016.

Sitorus, P. Program Linear. Jakarta: Penerbit Universitas Trisakti. 1997.

P, Siangian, Penelitian Operasional. Jakarta: Universitas Indonesia. 2006.

Hillier, S. F. & J. G. Lieberman. Introduction To Operations Research (Edition 9). New York: Mc Graw-Hill, Inc. 2008.

Nasendi B.D, Program Linear dan Variasinya. Jakarta: PT Gramedia Pustaka Utama. 1985

Mulyono, Riset Operasi. Jakarta: Fakultas Ekonomi Universitas Indonesia. 2004

A.H. Land, A.G. Doig. “An automatic method of solving discrete programming problems”. JurnalEconometrica. Vol 22, pp 497-520, 1960.

Supatimah Sri Siti, Farida, Andriani Siska. “Optimasi Keuntungan dengan Metode Branch and Bound”. Jurnal Matematika dan Pendidikan Matematika. vol 10 no 1, pp 13-23. 2019.

Hayati, Enty Nur. “Aplikasi Algoritma Branch and Bound untuk menyelesaikan Integer Programming”. Dinamika Teknik. vol 4 No 1 pp 13-23. 2010.

Downloads

Published

2023-10-30

How to Cite

Novita Sari Dewi, & James Piter Marbun. (2023). Application Of Thebranch And Bound In Optimizing The Amount Of Bread Production In CV. Zuhro Bakery Perbaungan. JURNAL RISET RUMPUN MATEMATIKA DAN ILMU PENGETAHUAN ALAM, 2(2), 53–64. https://doi.org/10.55606/jurrimipa.v2i2.1318