SOLVING BI-LEVEL PROGRAMMING PROBLEMS ON USING GLOBAL CRITERION METHOD WITH AN INTERVAL APPROACH

In this paper on using the global criterion method, the bi-level programming have been solved by an interval approach. We solve the bi-level programming on using Karush-Kuhn-Tucker (KKT) conditions, and global criterion method converts to a single objective and the we solve this problem. The advantage of this method can be extended solve for solving the problems with large-scale. In the end numerical example is given to illustrate the efficiency of the method.