An exact penalty on bilevel programs with linear vector optimization lower level

Abstract

We are interested in a class of linear bilevel programs where the upper level is a linear scalar optimization problem and the lower level is a linear multi-objective optimization problem. We approach this problem via an exact penalty method. Then, we propose an algorithm illustrated by numerical examples.Bilevel programming Linear programming Multiple objective programming Penalty methods

    Similar works

    Full text

    thumbnail-image

    Available Versions

    Last time updated on 06/07/2012