Solving Non-Linear Bi-Level Programming Problem Using Taylor Algorithm

Solving Non-Linear Bi-Level Programming Problem Using Taylor Algorithm

Eghbal Hosseini (Payamenur University of Tehran, Iran), Isa Nakhai Kamalabadi (University of Kurdistan, Iran) and Fatemah Daneshfar (University of Kurdistan, Iran)
DOI: 10.4018/978-1-4666-9644-0.ch030
OnDemand PDF Download:


In recent years the bi-level programming problem (BLPP) is interested by many researchers and it is known as an appropriate tool to solve the real problems in several areas such as economic, traffic, finance, management and so on. Also it has been proved that the general BLPP is an NP-hard problem. The literature shows a few attempts for using approximate methods. In this chapter we attempt to develop an effective approach based on Taylor theorem to obtain an approximate solution for the non-linear BLPP. In this approach using the Karush-Kuhn–Tucker, the BLPP has been converted to a non-smooth single problem, and then it is smoothed by the Fischer – Burmeister function. Finally the smoothed problem is solved using an approach based on Taylor theorem. The presented approach achieves an efficient and feasible solution in an appropriate time which is evaluated by comparing to references and test problems.
Chapter Preview

1. Introduction

The bi-level programming problem (BLPP) is a nested optimization problem, which has two levels in hierarchy. The first level is called leader and the second one is called follower. They have their own objective functions and constraints. The leader actions first, and the follower reacts to the leader decision. The follower should optimize its objective function according to the leader decision and delivered answers of the leader. In fact, the leader inflicts his decision on and obtains reaction of the follower.

It has been proved that the BLPP is an NP- Hard problem even to seek for the locally optimal solutions (Bard, 1991; Vicente, 1994). Nonetheless the BLPP is an applicable problem and a practical tool to solve decision making problems. It is used in several areas such as transportation, finance and so on. Therefore finding the optimal solution has a special importance to researchers.

Several algorithms have been presented for solving the BLPP (Lv, et. al., 2007; Allende, et. al, 2013; Mathieu, 1994; Wang, et. al., 2003; Weng, et. Al, 2000; Bard, 1991; Jiang, et. al. 2015). These algorithms are divided into the following classes: Transformation methods (Lv, et. al. 2007; Allende, et. al, 2013; Brotcorne, et. al, 2013; Dempe, et. al, 2012), Fuzzy methods (Sakawa, et. al. 1998; Shih, et. al. 1996; Pramanik, et. al. 2007; Sakawa, et. al. 2001; sakawa, et. al, 2012), Global techniques (Nocedal, 2006; Khayyal, 1985; Mathieu, 1994; Wang, et. al. 2003), Primal–dual interior methods (Weng, et. Al, 2000), Enumeration methods, (Thoai, et. al, 2004), Meta heuristic approaches (Hejazi, et. al, 2002; Wang, et. al, 2008; Hu, et. al, 2010; Pal, et. al. 2010; Wan, et. al. 2013, 25]. In the remaining of section, two classes of methods have been explained.

Complete Chapter List

Search this Book: