In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local optimal solutions. One small example is presented to illustrate the feasibility of the method.
TU Bergakademie Freiberg, Fakultät für Mathematik und Informatik, Preprint 2016 - 05