Optimization of Batik Production Using the Quick Simplex Method
Keywords:
optimization, linear programming, simplex method, quick simplex methodAbstract
Background and Objectives : To calculate the amount of Lampung batik production of the Andanan Batik Lampung company in Indonesia. There are 3 types of batik: printed batik, handmade batik and batik scarf that resulted in that resulted in the maximum profit using the quick simplex method compared with the simplex method.
Methodology : Study the problem of the maximum profit from batik production. Study the simplex method and the quick simplex method. Apply the quick simplex method to the problem of maximizing the profit of batik production. Compare the results with the simplex method. Summarize and discuss the finding.
Main Results : It was found that the Lampung batik production of the Andanan Batik Lampung company should be produced printed batik (4.05 dozen) and handmade batik (5.51 dozen) for the maximum profit 652,530 IDR.
Conclusions : When we calculated using the quick simplex method it was found that this method reduced the calculation process of the simplex table. The simplex method used three tables, but the quick simplex method used only two tables, which gave the same answer as the simplex method. In addition, Python programs were used to help verify the results. In order to achieve the maximum profitability of each type of batik production, it was found that the quick simplex method took time less than the simplex method, which was 0.21457 seconds.
References
Aldino, A. A., Ulfa, M. (2021). Optimization of Lampung Batik Production Using the Simplex Method. BAREKENG:Jurnal Ilmu Matematika dan Terapan, 15 (2), 297–304.
Ficken, F. A. (2015). The Simplex Method of Linear Programming. Courier Dover Publications.
Vaidya, N. V., & Kasturiwale, N. N. (2014). Comparison Between Various Entering Vector Criteria with Quick Simplex Algorithm for Optimal Solution to the Linear Programming Problem. International Journal of Mathematics and Statistics Invention, 2(6), 17–36.
Vaidya, N.V., Kasturiwale, N.N. (2014). Quick Simplex Algorithm for Optimal Solution to the Linear Programming Problem along with Theoretical Proof of Formulae. Int. J Latest Trend Math, (IJLTM), 4 (2), 183- 200.
Vaidya, N. V., & Kasturiwale, N. N. (2016). Application of Quick Simplex Method (A New Approach) On Two Phase Method. British Journal of Mathematics & Computer Science, 16(1), 1-15.
Vaidya, N. V., Pidurkar, S. R., Shanti M., & Uparkar, S. S. (2020). Graphical View of Quick Simplex Method to Solve Linear Programming Problem. International Journal of Advanced Science and Technology, 29 (6), 5694–5710.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Faculty of Science, Burapha University
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Burapha Science Journal is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence, unless otherwise stated. Please read our Policies page for more information