Optimalisasi Keuntungan D’nanas Dengan Metode Transportasi

Authors

  • Alief Noverdy Chaliandra Putra Program Studi Sistem Informasi, Fakultas Sains dan Teknologi, Universitas Jambi, 36361, Indonesia Author
  • Gibran Krisna Athallah Program Studi Sistem Informasi, Fakultas Sains dan Teknologi, Universitas Jambi, 36361, Indonesia Author
  • Muhammad Farhan Program Studi Sistem Informasi, Fakultas Sains dan Teknologi, Universitas Jambi, 36361, Indonesia Author

Keywords:

Linear programming, graphical method, optimization, pineapple products, SMEs

Abstract

This study applies the graphical method of transportation programming to optimize production decisions in small and medium enterprises (SMEs) processing pineapples. Tangkit Baru Village, as a case study, produces approximately 22,000 pineapples daily, with SMEs developing derivative products such as soft pineapple candy (PLN) and chocolate-coated pineapple chips. Although resources such as capital, raw materials, and labor are relatively sufficient, the profitability of these derivative products remains lower compared to the sale of fresh pineapples. This research aims to determine the optimal production combination of PLN and KNC that maximizes profit using the graphical method of linear programming. Two decision variables are modeled under the constraints of production time and demand capacity. The results show that a specific combination of PLN and KNC yields a higher overall profit compared to producing a single product. This study highlights the usefulness of the graphical method as a simple yet effective decision-making tool for micro and small enterprises in optimizing product diversification strategies.

Keywords: Linear programming, graphical method, optimization, pineapple products, SMEs

 

Abstrak

Penelitian ini menerapkan metode grafis pemrograman transportasi untuk mengoptimalkan keputusan produksi pada usaha mikro, kecil, dan menengah (UMKM) yang mengolah nanas. Desa Tangkit Baru, sebagai studi kasus, menghasilkan sekitar 22.000 buah nanas per hari, dengan UMKM mengembangkan produk turunan seperti permen nanas lunak (PLN) dan keripik nanas berlapis coklat (KNC). Meskipun sumber daya seperti modal, bahan baku, dan tenaga kerja cukup memadai, profitabilitas produk turunan ini tetap lebih rendah dibandingkan dengan penjualan nanas segar. Penelitian ini bertujuan untuk menentukan kombinasi produksi PLN dan KNC yang optimal guna memaksimalkan keuntungan dengan menggunakan metode grafis pemrograman linier. Dua variabel keputusan dimodelkan di bawah kendala waktu produksi dan kapasitas permintaan. Hasil penelitian menunjukkan bahwa kombinasi tertentu antara PLN dan KNC menghasilkan keuntungan keseluruhan yang lebih tinggi dibandingkan dengan memproduksi satu produk saja. Penelitian ini menyoroti kegunaan metode grafis sebagai alat pengambilan keputusan yang sederhana namun efektif bagi usaha mikro dan kecil dalam mengoptimalkan strategi diversifikasi produk.
Kata Kunci: Pemrograman linier, metode grafis, optimasi, produk nanas, UMKM

Downloads

Download data is not yet available.

References

1. AlAhmad, R., Al-Khaleel, M., & Almefleh, H. 2024. On solutions of linear and nonlinear fractional differential equations with application to fractional order RC type circuits. Journal of Computational and Applied Mathematics, 438, 115507. https://doi.org/10.1016/j.cam.2023.115507.

2. Zhu, J., & Zhu, X. 2023. The circular chromatic number of signed series–parallel graphs of given girth. Discrete Applied Mathematics, 341, 82–92. https://doi.org/10.1016/j.dam.2023.07.007.

3. Baione, F., & Levantesi, S. 2014. A health insurance pricing model based on prevalence rates: Application to critical illness insurance. Insurance: Mathematics and Economics, 58, 174–184. https://doi.org/10.1016/j.insmatheco.2014.07.005.

4. Kim, D. S., & Kim, T. 2020. A Note on a New Type of Degenerate Bernoulli Numbers. Russian Journal of Mathematical Physics, 27(2), 227–235. https://doi.org/10.1134/S1061920820020090.

5. Hopkins, S. B., Kamath, G., & Majid, M. 2022. Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1406–1417). New York, NY, USA: ACM. https://doi.org/10.1145/3519935.3519947.

6. Nualart, D. (n.d.). Anticipating stochastic calculus. In The Malliavin Calculus and Related Topics (pp. 169–223). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/3-540-28329-3_3.

7. Bohner, M., & Georgiev, S. G. 2016. Parameter-Dependent Integrals. In Multivariable Dynamic Calculus on Time Scales (pp. 261–302). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-47620-9_5.

8. Penot, J. P. 2013. Calculus Without Derivatives (Vol. 266). New York, NY: Springer New York. https://doi.org/10.1007/978-1-4614-4538-8.

9. Dixon, M. W. 1999. Application of neural networks to solve the routing problem in communication networks. (G. Cole, Ed.).

10. Strang, G. 2016, March 30. Calculus Volume 1. OpenStax. Accessed: August 24, 2023, https://openstax.org/books/calculus-volume-1/pages/5-3-the-fundamental-theorem-of-calculus.

11. Sudweeks, F. 2004. Development and leadership in computer-mediated collaborative groups. Murdoch University.

Downloads

Published

2025-12-12

Issue

Vol. 1 No. 2 (2025): Sinergi: Jurnal Ilmiah Multidisiplin

Section

Articles

License

Copyright (c) 2025 Alief Noverdy Chaliandra Putra, Gibran Krisna Athallah, Muhammad Farhan (Author)

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.