Integer Programming Application to Optimize Profit of Samarinda Special Souvenir Production

  • Lisnawati Universitas Mulawarman
  • Syaripuddin Universitas Mulawarman
  • Qonita Qurrota A'yun Universitas Mulawarman
Keywords: Linier Programming, - Branch and Bound Method, Simplex Revised Method, Optimize Production


Yulia's Amplang shop is one of the businesses engaged in the culinary field in the form of souvenirs typical of Samarinda City, namely Amplang. The amplang variants produced by this store include flat fish (original), shrimp, crab, squid and seaweed. Limitations and rising raw material prices make stores often experience difficulties in optimizing production profits. This study aims to determine the number of packages in one production process for each variant produced so as to obtain maximum profit. This study used the revised simplex method and then continued with the Branch and Bound Method, which is a method used to solve linear programming problems that produce solutions in integer form. From the analysis using this method, the optimal amount was obtained as many as 317 packages per production, including 144 flat fish flavors (original), 52 shrimp flavors, 34 crab flavors, 54 squid flavors and 33 seaweed flavors with the maximum profit obtained. namely Rp. 4,125,635. The application of this method resulted in an increase in profits of 5.53% or Rp. 216,103 in one production process compared to the previous company's profits.


Download data is not yet available.


Taha, H. A. (1996). Riset Operasi. Jakarta: Binarupa Aksara.

Zulyadaini. (2016). Program Linier. Yogyakarta: Tangga Ilmu [3] Aminudin. (2005). Prinsip-prinsip Riset Operasi. Jakarta: Erlangga.

Siyoto, S., & Sodik, M. A. (2015). Dasar Metodologi Penelitian. Yogyakarta: Literasi Media Publishing.

Hardani, Andriani, H., Ustiawaty, J., Utami, E. F., Istiqomah, R. R., Fardani, 'R. A., . . . Auliya, N. H. (2020). Metode Penelitian Kualitatif & Kuantitatif. Yogyakarta: CV. Pustaka Ilmu.

Aminudin. (2005). Prinsip-prinsip Riset Operasi. Jakarta: Erlangga.

Pratiwi, A., Mulyono, & Rochmad. (2014). Implementasi Algoritma Branch and Bound pada 0-1 Knapsack Problem untuk Mengoptimalkan Muatan Barang. UNNES Journal of Mathematics, 3(2).

How to Cite
Lisnawati, Syaripuddin, and Qonita Qurrota A’yun, “Integer Programming Application to Optimize Profit of Samarinda Special Souvenir Production”, JI, vol. 8, no. 2, pp. 290-294, Sep. 2023.

Most read articles by the same author(s)