Pessimistic Bilevel Linear Optimization
Keyword(s):
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.
2018 ◽
2011 ◽
Vol 01
(04)
◽
pp. 294-302
1987 ◽
Vol 23
(2)
◽
pp. 107-116
◽
1991 ◽
Vol 21
(6-7)
◽
pp. 77-85
◽
Keyword(s):