On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints

DOI10.1186/s13660-017-1558-xzbMath1375.90292OpenAlexW2768129592WikidataQ47122071 ScholiaQ47122071MaRDI QIDQ1681796

Peng Zhang

Publication date: 24 November 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1558-x

zbMATH Keywords

generalized convexityoptimality conditionssemi-infinite programmingmathematical programs with vanishing constraints

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Semi-infinite programming (90C34)

Related Items (11)

On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints ⋮ Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints

Uses Software

• NSIPS

Cites Work

• Unnamed Item
• Mathematical programs with vanishing constraints: critical point theory
• On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
• Convexificators and strong Kuhn-Tucker conditions
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Air pollution control with semi-infinite programming
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Robot trajectory planning with semi-infinite programming.
• On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
• Nonsmooth semi-infinite multiobjective optimization problems
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• Optimality conditions for nonsmooth semi-infinite multiobjective programming
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
• Semi-infinite transportation problems
• Semi-infinite programming. Recent advances

This page was built for publication: On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints