Solving a class of multiobjective bilevel problems by DC programming

Aicha Anzi and Mohammed Said Radjef

International Journal of Operational Research, 2020, vol. 37, issue 2, 157-173

Abstract: In this paper, we consider a class of multiobjective bilevel programming problems in which the first level objective function is assumed to be a vector valued DC function and the second level problem is a linear multiobjective program. The problem is transformed into a standard single optimisation problem by using a preference function. We give a characterisation to the induced region and reformulate the problem as a problem of optimising a function over the efficient set. Next, a well-known representation of the efficient set is used which will allow to transform the problem, using an exact penalisation, into a DC program. Finally, we apply the DC algorithm to solve the resulting DC program.

Keywords: bilevel programming; multiobjective optimisation; exact penalty; DC algorithm; DCA; DC programming; preference function. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=105364 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:37:y:2020:i:2:p:157-173

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().