Abstract
In this paper, we investigate a multiobjective bilevel optimization problem with a vector-valued lower-level objective function. We revisit the Charnes–Cooper scalarization technique for multi-objective programs and use optimal value reformulation to transform the scalar problem into a one-level optimization problem. Using Mordukhovich's generalized differentiation calculus, a new subdifferential estimate and Lipschitz condition for the optimal value function of this problem are developed as a result of this reformulation. In addition, we construct first-order necessary optimality conditions in the smooth setting.
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.
