Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming

DOI10.1007/s00574-019-00190-9zbMath1473.90155OpenAlexW2994858378WikidataQ126567379 ScholiaQ126567379MaRDI QIDQ2660142

Le Thanh Tung

Publication date: 29 March 2021

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00574-019-00190-9

zbMATH Keywords

Clarke subdifferentialsmultiobjective semi-infinite programmingBorwein properly efficient solutionsMordukhovich subdifferentialsstrong KKT optimality conditions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)

Related Items (6)

Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ On optimality conditions and duality for multiobjective optimization with equilibrium constraints ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint qualifications in convex vector semi-infinite optimization
• Isolated and proper efficiencies in semi-infinite vector optimization problems
• Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems
• On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
• Constrained qualifications in multiobjective optimization problems: Differentiable case
• On the notion of proper efficiency in vector optimization
• Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
• On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
• Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
• On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
• Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
• Nonsmooth semi-infinite multiobjective optimization problems
• Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators
• Optimality conditions in convex multiobjective SIP
• Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
• Optimality conditions for nonsmooth semi-infinite multiobjective programming
• The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
• Optimization and nonsmooth analysis
• Proper Efficient Points for Maximizations with Respect to Cones
• First-order necessary conditions in locally Lipschitz multiobjective optimization
• On Optimality Conditions for Henig Efficiency and Superefficiency in Vector Equilibrium Problems
• Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
• Multicriteria Optimization
• Convex Analysis

This page was built for publication: Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming