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 …

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 article presents a feasible sequential convex programming method to solve the
multistage ascent trajectory optimization problem. The proposed method is based on the …

This paper presents a bilevel programming framework for a harmonizing model with transfer
tax (HMTT) on water pollution across regional boundaries of a lake basin in China, where …

The bilevel programming problem is strongly NP-hard and non-convex, which implies that
the problem is very challenging for most canonical optimization approaches using single …

A new general scheme for Inexact Restoration methods for Nonlinear Programming is
introduced. After computing an inexactly restored point, the new iterate is determined in an …

A numerical method is presented for Runge–Kutta discretization of unconstrained optimal
control problems. First, general Runge–Kutta discretization is carried out to obtain a finite …

Abstract The Inexact Restoration method for Euler discretization of state and control
constrained optimal control problems is studied. Convergence of the discretized (finite …

Recent papers indicate that some algorithms for constrained optimization may exhibit worst-
case complexity bounds that are very similar to those of unconstrained optimization …

In this paper, we develop a bi–level transferable air pollutant price (TAPP) model, and use
the model to find ways to mitigate China's interprovincial air pollution control problem. In this …