Bilevel optimization is defined as a mathematical program, where an optimization problem
contains another optimization problem as a constraint. These problems have received …

Bilevel optimization is a vital field of active research. Depending on its formulation it is part of
nonsmooth or nondifferentiable optimization, conic programming, optimization with …

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 …

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 work develops analysis and algorithms for solving a class of bilevel optimization
problems where the lower-level (LL) problems have linear constraints. Most of the existing …

This research highlights the use of game theory to solve the classical problem of the
uncapacitated facility location optimization model with customer order preferences through a …

In this work, we develop an implicit gradient-type (IG-AL) algorithm for bilevel optimization
with strongly convex linear inequality constrained lower-level problems. Many learning …

Despite engineers' best intentions, technological innovations intended to reduce resource
consumption are not assured to achieve their desired effects. As self-interested agents …

Purpose–One of the most important problems concerning the toll roads is the setting of an
appropriate cost for traveling through private arcs of a transportation network. The purpose …

A Bilevel Optimization Problem (BOP) is related to two optimization problems in a
hierarchical structure. A BOP is solved when an optimum of the upper level problem is …