Introduction Bilevel programming plays an important role in different application fields, such as transportation, economics, ecology, engineering and others[1], it has been developed and studied by many authors[2-8]. However, Even a linear bilevel programming problem is generally difficult to be solved and it has been proved to be strongly NP-hard [9]. In this paper, we consider the following l...

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and single follower are involved. This paper proposes a general model and Kuhn-Tucker approach for linear bilevel programming problems in which one leader and multiple follower(s) are involved, and there may (not) be sharing variables among the followers. Finally, a numeric...

Bilevel programming, a tool for modeling decentralized decisions, consists of the objective of the leader at its 1rst level and that of the follower at the second level. Bilevel programming has been proved to be NP-hard problem. Numerous algorithms have been developed so far for solving bilevel programming problem. In this paper, an attempt has been made to develop an e6cient approach based on ...

We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed parametric programming algorithms. We first describe how we can recast and solve the inner (follower’s) problem of the bilevel formulation as a multi-parametric programming problem, with parameters being the (unknown) variables of the outer (leader’s) ...

In this paper, we consider a kind of bilevel linear programming problem where the coefficients of both objective functions are fuzzy random variables. The purpose of this paper is to develop a computational method for obtaining optimistic Stackelberg solutions to such a problem. Based on a level sets of fuzzy random variables, we first transform the fuzzy random bilevel programming problem into...

In this paper we formulate the fuzzy bilevel programming problem and describe one possible approach for formulating a crisp optimization problem being attached to it. Due to the nature of fuzzy bilevel programming this is a crisp bilevel programming problem. We compare our approach with one using multicriterial optimization and show, that both approaches are basically different. The use of mult...

Optimization problems with complementarity constraints are closely related to optimization problems with variational inequality constraints and bilevel programming problems. In this paper, under mild constraint qualifications, we derive some necessary and sufficient optimality conditions involving the proximal coderivatives. As an illustration of applications, the result is applied to the bilev...