CD Skripsi
Penyelesaian Masalah Pemrograman Pecahan Kuadratik Menggunakan Metode Dekomposisi
This nal project discusses a method for solving a quadratic fractional
programming (QFP) problems. The method is called the decomposition
method based on linear programming (LP) problem for nding an optimal
solution to a quadratic fractional programming (QFP) problem, where both
the numerator and the denominator of the objective function can be fatorized
into two linear functions. The method is reviewed in detail to solve quadratic
fractional programming problems. Illustration in the form of example are
given to better understand the completion of the programming using
decomposition method.
Keywords: Quadratic fractional programming, linear programming, simplex
method
Tidak tersedia versi lain