CD Skripsi
Analisis Sensitivitas Pemrograman Linear Grey Dengan Metode Simpleks
This final of project discusses the solution of sensitivity analysis of grey linear programming using simplex method. Sensitivity analysis is used to determine the limits of grey number changes in the objective function coefficients, changes in the value of the right-hand side of the constraint function, and changes in the nonbasic column coefficients of the constraint function so that the optimal solution can be maintained. Parameter changes are analyzed by adding ∆ to the upper and lower limits of the interval grey number so that the optimal solution does not change. The objective function coefficient, constraint coefficient, and constraint constant are grey numbers. Grey linear programming is solved by the simplex method based on the grey number operation. It can be concluded that the simplex method can be used as an alternative method in sensitivity analysis of grey linear programming.
Keywords: Grey number, grey linear programming, simplex method, sensiti- vity analysis
Tidak tersedia versi lain