CD Skripsi
Penyelesaian Pemrograman Linearkendala Campuran Dengan Metode Pengali Lagrange
This final project discusses the problem of mixed constraint linear programming and solves them using the Lagrange multiplier method. Linear programming is used to solve problems in everyday life. Problems that are often associated with linear programming are always related to various fields of economics such as problems that often occur in home industry businesses, namely the insta- bility of expenses and production costs resulting in non-optimal profits. This research aims to find out how much is obtained per production in order to get optimal profits using the Lagrange multiplier method. This method begins by formulating the problem into linear programming and converting the inequality constraints into equations so that they can be formed into Lagrange functions, then partially differentiating the Lagrange function is equal to zero, the values of the Lagrange function are calculated using matrix multiplication that meets the Kuhn-Tucker conditions in order to obtain an optimal solution. Based on calculations using the Lagrange multiplier method, the optimal amount of pro- duction in a day at the ”Shanum Cake” business is 16 pieces of cube bread, 24 pieces of chocolate stick bread, 20 pieces of cromboloni bread, and 24 pieces of mini croissant bread with optimal profit that can be obtained at Rp204, 000 in a day. It can be concluded that the Lagrange multiplier method can be used as an alternative method in solving mixed constraint linear programming problems.
Keywords: Linear programming, Lagrange multiplier method, Kuhn-Tucker, mixed constraints
Tidak tersedia versi lain