A bilevel programming model represents the relationship in a specific decision process that
involves decisions within a hierarchical structure of two levels. The upper-level problem is …

Bilevel optimization problems are hierarchical optimization problems where the feasible
region of the so-called upper level problem is restricted by the graph of the solution set …

This paper presents taxonomy of detailed literature reviews on bi-level programming
problems (BLPPs), multi-level programming problems (MLPPs) and associated research …

Multi-level decision-making (MLDM) handles problems that require compromise between
the objectives of two or more interacting entities which are arranged within a hierarchical …

This paper addresses a hierarchical production–distribution planning problem. There are
two different decision makers controlling the production and the distribution processes …

Bilevel programming involves two optimization problems where the constraint region of the
first level problem is implicitly determined by another optimization problem. This paper …

In this paper, a hybrid intelligent algorithm by combining the particle swarm optimization
(PSO) with chaos searching technique (CST) is presented for solving nonlinear bilevel …

Bi-level linear programming is a technique for modeling decentralized decision. It consists of
the upper-level and lower-level objectives. This paper attempts to develop an efficient …

Bilevel programming problems are characterized by two optimization problems which are
hierarchically related, where to each feasible upper level solution an optimal solution in the …

Bilevel optimization refers to a hierarchical problem in which optimization needs to be
performed at two nested levels, namely the upper level and the lower level. The aim is to …