Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Kubik

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