• Dr. Anuradha Sharma

An algorithm is proposed in this study for solving multilevel quadratic(integer) programming problems with linear constraints. A convergent algorithm based on Stackelberg strategy is employed which solve (MQIP) problem which does not increase the complexities of the problem under consideration for a given choice of the variables under the control of the upper level decision maker. The problem is solved considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of lower levels. An enumerative algorithm is proposed which finds a global solution to the problem.

Quasi concave functions, Non-convex optimization, Multilevel programming, Enumerative method.

"An Approach for Multilevel Quadratic Integer Programs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.3, Issue 6, page no.148-159, June-2016, Available :http://www.jetir.org/papers/JETIR1912019.pdf

"An Approach for Multilevel Quadratic Integer Programs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.3, Issue 6, page no. pp148-159, June-2016, Available at : http://www.jetir.org/papers/JETIR1912019.pdf