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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
