CD Skripsi
Menyelesaikan Program Pecahan Linear dengan Menggunakan Program Dinamis Maju
This final project discusses the solution of fractional linear programming using dynamic programming forward methods. The solution to this problem is to find the optimal solution of the fractional linear programing by changing the fractional objective function to an approximation function using the simplified method, followed by using the simplex method until the optimal solution is obtained. Then, the optimal solution is found using the dynamic programming forward method. It can be concluded that the dynamic programming forward method produces better solution compared to the approximation of objection function methods.
Keywords: Fractional linear programming, simplex method, dynamic pro- gramming
Tidak tersedia versi lain