Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies
Informacja
SZANOWNI CZYTELNICY!
UPRZEJMIE INFORMUJEMY, ŻE BIBLIOTEKA FUNKCJONUJE W NASTĘPUJĄCYCH GODZINACH:
Wypożyczalnia i Czytelnia Główna: poniedziałek – piątek od 9.00 do 19.00