Kajian Metode Penalti dan Aplikasinya Pada Masalah Penugasan

Abstract

One method that can be used to solve linear programming problems is the penalty method. The penalty method can solve the maximum case and the minimum case. Such cases are often found in everyday life in assignment problems. The objective of the assignment problem is to assign a task to a subject in such a way as to obtain optimal results. The penalty method is a method that can be used to solve assignment problems. An example of a maximum case assignment problem occurs in a business unit engaged in the clothing convection industry, which wants to maximise the production of goods, and an example of a minimum case assignment problem occurs in a business unit engaged in shipping services or delivery of goods, which wants to minimise the delivery time. This study found that the penalty method was most effective in the maximisation case, producing 33,800 garments with optimal formation placement. In the minimisation case, the penalty method resulted in 105 minutes of delivery time with sub-optimal results.