By applying Kuhn-Tucker condition the quadratic bilevel programming, a class of bilevel programming, is transformed into a single level programming problem, which can be simplified by some rule. So we can search the o...By applying Kuhn-Tucker condition the quadratic bilevel programming, a class of bilevel programming, is transformed into a single level programming problem, which can be simplified by some rule. So we can search the optimal solution in the feasible region, hence reduce greatly the searching space. Numerical experiments on several literature problems show that the new algorithm is both feasible and effective in practice.展开更多
基金Supported by the National Natural Science Foundation of China (70371032,60574071)
文摘By applying Kuhn-Tucker condition the quadratic bilevel programming, a class of bilevel programming, is transformed into a single level programming problem, which can be simplified by some rule. So we can search the optimal solution in the feasible region, hence reduce greatly the searching space. Numerical experiments on several literature problems show that the new algorithm is both feasible and effective in practice.
