Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
Tadeusz Antczak
Abstract
Abstract In this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality conditions and, under appropriate invexity hypotheses, sufficient optimality conditions are proved for such nonconvex smooth vector optimization problems. Further, vector duals in the sense of Mond–Weir are defined for the considered differentiable semi-infinite multiobjective programming problems with vanishing constraints and several duality results are established also under invexity hypotheses.
Topics & Concepts
Dual polyhedronDuality (order theory)Differentiable functionMathematicsClass (philosophy)Multiobjective programmingApplied mathematicsMathematical optimizationPure mathematicsMulti-objective optimizationComputer scienceArtificial intelligenceOptimization and Variational AnalysisOptimization and Mathematical ProgrammingAdvanced Optimization Algorithms Research