CD Skripsi
Penyelesaian Pemrograman Kuadratik Dengan Koefisien Kendala Bilangan Fuzzy Segitiga
This final project discusses a method for solving a quadratic programming problems
with constraint coefficient fuzzy numbers in triangular form. Quadratic
programming is solved by triangular fuzzy numbers by transforming it first in
crisp constraint. Then, simplex method is used through the formation process
of linear programming by Wolfe’s method. The simplex method is used for
solving quadratic programming in order to obtain the optimum solution. The
author provides an illustration in the form of example in order to understand
deeply about how to solve the quadratic programing using the extendedWolfe’s
method.
Keywords: Quadratic programming, triangular fuzzy number, crisp constraint,
simplex method
Tidak tersedia versi lain