Full Text: PDF
Volume 4, Issue 3, 1 December 2020, Pages 399-414
Abstract. Fritz John necessary conditions for solutions of nonsmooth multiobjective bilevel programming problems involving inequality constraints in terms of convexificators are established. Karush-Kuhn-Tucker necessary efficiency conditions are derived under the constraint qualification (CQ). With assumptions on generalized convexity, necessary efficiency conditions become sufficient ones.
How to Cite this Article:
Do Van Luu, Tran Thi Mai, Efficiency conditions for multiobjective bilevel programming problems via convexificators, J. Nonlinear Var. Anal. 4 (2020), 399-414.