CD Skripsi
Penyelesaian Pemrograman Kuadratik Kendala Linier Dengan Metode Syarat Kuhn-Tucker
This final project discusses the quadratic programming problem of linear con- straints and solves it using the Kuhn-Tucker condition method. This method starts by changing the inequality constraint into an equation using the additio- nal function of the Lagrange multiplier. The multiplier is used to convert the extreme point of a constraint function into a point. Each Lagrange multiplier must satisfy the Kuhn-Tucker necessary conditions in order to form a feasible solution. Next, the quadratic model that has been transformed into a linear model will be solved by the Wolfe’s method to obtain the optimal solution by minimizing the number of artificial variable values. It can be concluded that the Kuhn-Tucker conditional approach can be used as an alternative in solving mixed constraint quadratic programming problems.
Keywords: Quadratic programming, Kuhn-Tucker conditions, mixed linear constraint, Wolfe method
Tidak tersedia versi lain