Analisis Dualitas Program Linier dalam Optimasi Biaya Produksi Minuman pada Warung Kopi

Authors

  • Nerli Khairani Universitas Negeri Medan
  • Ellys Rebecca Simanjuntak Universitas Negeri Medan
  • Maysi Puspita Universitas Negeri Medan
  • Keisya Amelia Putri Universitas Negeri Medan

DOI:

https://doi.org/10.23969/jp.v11i02.49421

Keywords:

linear programming; duality; simplex method; production optimization; minimum cost

Abstract

Problems in beverage production in small businesses often occur due to limited raw materials, production time, and operational costs, so that an optimal production combination is needed to minimize costs. This study discusses the application of linear programming duality in optimizing beverage production costs at the "Pak Budi" Coffee Shop with two decision variables, namely the production of Milk Coffee and Iced Coffee. The method used is a linear program with a duality approach and the simplex method to solve the optimization model. The primal minimization model is formed based on the constraints of the availability of coffee beans, milk, ice cubes, sugar, and production time, then transformed into a dual maximization model and solved using the simplex method. The results of the analysis show that the optimal solution is obtained at the production of approximately 2.67 glasses of Milk Coffee and 2 glasses of Iced Coffee with a minimum production cost of Rp21,333.33 per day. In addition, the optimal value of the dual model is the same as the optimal value of the primal model, thus proving the validity of the Strong Duality Theorem. The application of duality and the simplex method has proven effective in determining efficient production combinations and minimizing production costs in small-scale businesses.

Downloads

Download data is not yet available.

References

Bertsimas, D., & Dunn, J. (2021). Optimization and Data Science in Linear Programming. Operations Research Journal.

Chendrawan, T. S. (2017). Teorema Amplop dan Dualitas The Structure of Economics, Silberberg. Tirtayasa Ekonomika, 12(2), 315–340.

Goli, M., & Nasseri, S. H. (2021). Extension of Duality Results and a Dual Simplex Method for Linear Programming Problems With Intuitionistic Fuzzy Variables. Fuzzy Information and Engineering.

Gondzio, J. (2023). Advances in Linear Optimization Methods. European Journal of Operational Research.

Hasibuan, C. K., Sahara, R., Dalimunte, R. A., & Ginting, S. S. B. (2025). Analisis Teori Dualitas dalam Program Linier: Konsep, Implikasi, dan Aplikasinya. Jurnal Ilmu Tarbiyah dan Keguruan (JITK), 3(2), 149–169.

Huiberts, S., Lee, Y. T., & Zhang, X. (2022). Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. arXiv.

Im, J., & Wolkowicz, H. (2022). Revisiting Degeneracy, Strict Feasibility, Stability in Linear Programming. arXiv.

Lina, T. N., Rumetna, M. S., Pangaribuan, E. A. W., Permana, M., Mambrasar, Y., Martvie, N., Magdalena, M., Tambayong, H., Kaliele, J., & Tangmerun, D. (2021). Premium Dan Pertalite Menggunakan Metode Maximization Of Profit On Premium And Pertalite Businesses Using Simplex Methods And Pom-Qm. Elektro Luceat, 7(1), 1–9.

Maifa, T. S., Garak, S. S., & Dominikus, W. S. (2021). Implementasi Bentuk Dualitas dan Analisa Sensitivitas Masalah Goal Programming. RANGE Jurnal Pendidikan Matematika.

Makni, J., & Wardana, H. (2016). Pemodelan Minimasi Biaya Produksi Menggunakan Metode Simpleks. Informatics for Educators and Professionals, 1(1), 27–36.

Perkins, P. T., & Gao, X. (2023). Dual Dictionaries in Linear Programming. arXiv.

Safitri, E., Basriati, S., & Andiani, E. (2021). Penerapan Program Linier Menggunakan Metode Dual Simpleks dan Metode Quick Simpleks untuk Meminimumkan Biaya. Journal of Fundamental Mathematics and Applications.

Saryoko, A. (2016). Metode Simpleks Dalam Optimalisasi Hasil Produksi. Informatics for Educators and Professionals, 1(1), 27–36.

Susanti, V. (2021). Optimalisasi Produksi Tahu Menggunakan Program Linear Metode Simpleks. MATHunesa: Jurnal Ilmiah Matematika.

Voulgaropoulou, S., Samaras, N., & Ploskas, N. (2022). Predicting the Execution Time of the Primal and Dual Simplex Algorithms Using Artificial Neural Networks. Mathemati

Downloads

Published

2026-06-08