scholarly journals Optimalisasi Produksi Tahu Menggunakan Metode Branch and Bound dan Cutting Plane

2021 ◽  
Vol 6 (2) ◽  
pp. 175
Author(s):  
Fatimah Khilaliyah Azzahrha ◽  
Rianita Puspa Sari ◽  
Muhamad Dhika Rahma Fauzi
Keyword(s):  
Branch And Bound ◽  
Cutting Plane

Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems

1993 ◽  
Vol 3 (3) ◽  
pp. 377-391 ◽  
Author(s):  
L� D. Muu ◽  
W. Oettli
Keyword(s):  
Nonlinear Programming ◽  
Branch And Bound ◽  
Cutting Plane ◽  
Cutting Plane Methods

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

1994 ◽  
Vol 21 (7) ◽  
pp. 777-785 ◽  
Author(s):  
Kurt M. Bretthauer ◽  
A.Victor Cabot
Keyword(s):  
Branch And Bound ◽  
Cutting Plane ◽  
Concave Minimization ◽  
Cutting Plane Algorithm

scholarly journals PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI

2016 ◽  
Vol 5 (4) ◽  
pp. 148
Author(s):  
GEDE SURYAWAN ◽  
NI KETUT TARI TASTRAWATI ◽  
KARTIKA SARI
Keyword(s):  
Branch And Bound ◽  
Cutting Plane ◽  
Optimal Combination ◽  
Branch And Bound Algorithm ◽  
Cutting Plane Method ◽  
Plane Method ◽  
Optimal Value ◽  
Bread Production

Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production. The aim of this study was to find optimal profit and optimal combination of bread production (original chocolate bread, extra chocolate bread, rounding chocolate bread and mattress chocolate bread) that was produced by Ramadhan Bakery by applying Branch and Bound Algorithm method. Branch and Bound Algorithm is one method to solve Integer Programming’s problems other than Cutting Plane method. Compared with Cutting Plane method, Branch and Bound Algorithm method is more effective in determining the optimal value. As the result of this study showed that to get optimal profit, Ramadhan Bakery should produce 360 pcs of original chocolate bread, 300 pcs of extra chocolate bread, 306 pcs of rounding chocolate bread and 129 pcs of mattress chocolate bread with optimal profit amounts Rp. 1.195.624,00.. The profit will increase amounts 25,2 % than before.

MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles

2017 ◽  
Vol 286 (1-2) ◽  
pp. 147-172
Author(s):  
Rafael Castro de Andrade ◽  
Rommel Dias Saraiva
Keyword(s):  
Branch And Bound ◽  
Shortest Paths ◽  
Cutting Plane ◽  
Dual Model ◽  
Primal Dual ◽  
Negative Cycles

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

1992 ◽  
Vol 43 (5) ◽  
pp. 443-457 ◽  
Author(s):  
G. L. Nemhauser ◽  
G. Sigismondi
Keyword(s):  
Branch And Bound ◽  
Cutting Plane ◽  
Branch And Bound Algorithm ◽  
Node Packing

Cutting Plane and Branch and Bound for Solving a Class of Scheduling Problems

1984 ◽  
Vol 16 (1) ◽  
pp. 50-58
Author(s):  
Carvel S. Wolfe
Keyword(s):  
Branch And Bound ◽  
Cutting Plane ◽  
Scheduling Problems

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

1992 ◽  
Vol 43 (5) ◽  
pp. 443 ◽  
Author(s):  
G. L. Nemhauser ◽  
G. Sigismondi
Keyword(s):  
Branch And Bound ◽  
Cutting Plane ◽  
Branch And Bound Algorithm ◽  
Node Packing

scholarly journals METODE PEMECAHAN MASALAH INTEGER PROGRAMMING

At-Taqaddum ◽  
2017 ◽  
Vol 7 (2) ◽  
pp. 211
Author(s):  
Siti Maslikhah
Keyword(s):  
Integer Programming ◽  
Problem Solving ◽  
Branch And Bound ◽  
Cutting Plane ◽  
Integer Solution ◽  
Cutting Plane Algorithm ◽  
Linear Programs ◽  
Error Level ◽  
Decision Variables ◽  
Integer Solutions

<em>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.</em>

PENJADWALAN OPTIMAL TIPE PRODUKSI FLOWSHOP DUA TAHAP MENGGUNAKAN METODE BRANCH AND BOUND DENGAN MEMPERHATIKAN WAKTU TRANSPORTASI

2017 ◽  
Vol 2 (1) ◽  
pp. 1-8
Author(s):  
Marie Muhammad ◽  
Elis Ratna Wulan
Keyword(s):  
Branch And Bound

Penjadwalan produksi dapat dibagi menjadi dua jenis, yaitu penjadwalan produksi tipe jobshop dan penjadwalan produksi tipe flowshop. Penjadwalan produksi tipe flowshop adalah sebuah penjadwalan sebuah produk yang sedemikian rupa sehingga setiap produk diproduksi melalui mesin yang sama dengan alur produksi yang sama. Terdapat beberapa masalah flowshop, salah satunya adalah dengan memperhatikan waktu transportasi. Dan metode Branch and Bound adalah solusi yang tepat untuk memecahkan masalah penjadwalan produksi dengan memperhatikan waktu transportasi untuk meminimalisir waktu yang terlewati. Pada penulisan Studi Literatur ini, Penjadwalan optimal dari 4 buah job dan 2 buah mesin dengan memperhatikan waktu transportasi adalah 1, 2, 4, dan 3 dengan waktu yang terlewati adalah 59 unit satuan waktu.

Sign in / Sign up

Export Citation Format

Share Document