Claim Missing Document
Check
Articles

Found 5 Documents
Search
Journal : KUBIK: Jurnal Publikasi Ilmiah Matematika

Penerapan Metode Branch and Bound dalam Optimalisasi Produk Mebel (Studi kasus: Toko Mebel di Jalan Marsan, Panam) Elfira Safitri; Sri Basriati; Hasyratul Najmi
KUBIK Vol 5, No 1 (2020): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v5i1.8611

Abstract

Setiap pelaku usaha atau pelaku ekonomi pasti melakukan prinsip ekonomi yaitu dengan usaha atau modal yang sedikit mampu menghasilkan keuntungan yang banyak, sehingga menyebabkan munculnya masalah optimasi. Metode yang digunakan dalam penelitian ini adalah metode Branch and Bound. Penelitian ini bertujuan untuk mengetahui optimalisasi produk mebel yang berada di jalan Marsan Panam  menggunakan metode Branch  and Bound. . Solusi  awal didapat   menggunakan metode simpleks. Apabila hasilnya bernilai non integer maka dilanjutkan dengan  metode Branch and Bound untuk mendapatkan solusi yang integer.  Berdasarkan hasil penelitian  diperoleh bahwa untuk mengoptimalkan produk mebel dengan keuntungan maksimal, maka toko mebel di Jalan Marsan,  Panam menerima pesanan produk mebel tempat tidur sebanyak 4 unit, lemari tiga pintu sebanyak 4 unit, lemari dua pintu sebanyak 2 unit dan meja makan sebanyak 3 unit dengan keuntungan produksi sebesar Rp. 14.250.000.Kata kunci: Branch and bound, integer, metode simpleks, optimalisasi      
Penyelesaian Metode Quick Simplex Terhadap Metode Dua Fase dengan Dua Elemen secara Simultan pada Kasus Minimum Elfira Safitri; Sri Basriati; Mohammad Soleh; Ade Novia Rahma
KUBIK Vol 6, No 1 (2021): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v6i1.12259

Abstract

Linear programming is a way to solve the problemof allocating limiter resources optimally. One of the methods used in solving the simplex method for mixed constraints is the two-phase method. There is a new approach to solve linear programming problems, namely the quick simplex method is carried out using a matrix to reduce the number of iterations needed to achieve the optimal solution. Completion step for the minimum case are the same as for the maximum case, the difference is only taking the entering variable, namely taking a positive value on the zj-cj line minimum case. The method used in this research is the two-phase quick simplex method. The purpose this study to find out the optimal solution for solving the quick simplex method in the two-phase method for the minimum case. Based on the research result, the quick simplex metode of entering variables and leaving variables can be taken two elements at simultaneously,resulting in fewer iterations than the usual two-phase method.
Penyelesaian Goal Programming menggunakan Metode Simpleks Direvisi dalam Memaksimalkan Keuntungan pada Home Industri Upik Padang Panjang, Sumatera Barat Elfira Safitri; Sri Basriati; Syafrika Yuliarti; Muhammad Soleh; Ade Novia Rahma
KUBIK Vol 6, No 2 (2021): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v6i2.10908

Abstract

Upik Home Industry is one of the businesses engaged in the chips industry. Problems in Upik Home Industry that are often faced in decision making are problems that contain several goals in it. To overcome these problems, the Goal Programming approach is used. Goal Programming is an extension of linear programming which is used to solve linear equations with more than one objective function. The purpose of this study was to determine the completion of Goal Programming using the revised simplex method in maximizing profits at Upik Home Industry Padang Panjang, West Sumatra. The method used in this study is the revised simplex method. The revised simplex method uses an inverse basis to perform calculations in determining the incoming and outgoing variables. Based on the results of research, the goal is to minimize working times, minimize raw materials for cassava, oil, salt and maximize sales quotas for sanjai balado and is not  achieved. And goals for maximizing profit,  goals for minimizing raw material for garlic and minimizing the sales quota for sanjai original, sanjai kunyit dan tusuk gigi  is achieved. So that the total production for original sanjai ( as much 30,67 kg, sanjai kunyit ( as much 18 kg and tusuk gigi ( as much 18 kg.Keywords: Goal Programming, Home industry, Revised Simplex.
Optimal Control of Vaccination for Dengue Fever in SIR Model Nilwan Andiraja; Sri Basriati; Elfira Safitri; Rahmadeni Rahmadeni; Alfitra Martino
KUBIK Vol 7, No 2 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v7i2.21397

Abstract

According to data from The Indonesian ministry of health, many of individuals suffere dengue fever until may 2023 in Indonesia. To reduce its cases, in this article, a single of control strategy of vaccination for infected human by dengue fever has been proposed. To obtain the optimal control, the SIR model has been modificated with single control and the new objective function has been made before the Pontryagin minimum principle is used in this article. According to the differential equation in the model of the dengue fever and the objective function, we made the Hamiltonian equation. Then, from it, the state equation, costate equation, and stationary condition has been made from the Hamiltonian equation so we obtained the optimal control in vaccination. In the end of this article, we did the numerical simulation using the sweep forward-backward method. Through numerical simulation, we find that the control succeed to reduce the infected human by dengue fever and also increase human recovery from this desease. Futhermore, the control of vaccination for infected human should be implemented not only in this mathematical model but also into real life to decrease the dengue fever case. 
Optimasi Biaya Pemupukan Tanaman Padi pada Kelompok Tani Rambahan Sakato, Desa Nyiur Melambai Pelangai menggunakan Metode Kuhn Tucker Elfira Safitri; Sri Basriati; Mohammad Soleh; Rahmi Yulanda
KUBIK Vol 8, No 1 (2023): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v8i1.18261

Abstract

The Rambahan Sakato Farmer Group, Nyiur Melambai Pelangai Village, West Sumatra is a farmer groups that produces various types of food, one of which is rice plants. One of the factors that support plants to grow optimally is the availabity of nutrients in sufficient quantities in the soil. There are four types of fertilizers used in the fertilization of rice plants, namely SP-36 fertilizer, Urea fertilizer, Phonska fertilizer and KCL fertilizer. This study aims to optimal solution in determining in amount of fertilizer in rice plants with the minimum cost using the Kuhn Tucker Method. The method used in this research is the Kuhn Tucker method. The solution to the Kuhn-Tucker method is the same as the Lagrange method, namely calculating the value (x, λ, S) and calculating the value of f (x). The process of finding values (x, λ, S) uses matrix multiplication. Based on the research results, it was found that the Rambahan Sakato farmer group needed to provide 1 sack of SP-36 fertilizer, 3 sacks of urea fertilizer, 16 sacks of Phonska fertilizer and did not need to provide KCL fertilizer at a minimum cost of Rp. 2,710,000.