Optimization Quadratic Bilevel Programming Problems

In this paper, we propose a global optimization approach for the solution of quadratic bilevel programming problem using of Taylor Series. We first both objectives function are transformed by using 1st order Taylor poly nomial Series. Here, the Taylor Series obtains polynomial objective functions which are equivalent to quadratic objective functions. Thus, BLQPP can be reduced into a single function. Levels are classied as upper level and lower level, and they are weighted with respect to their classes before Taylor series approach unied levels by using their weights. Finally, numerical example drawn from the open literature are presented to illustrate the proposed approach.