Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
From MaRDI portal
Publication:2150784
DOI10.1007/s10479-020-03742-1zbMath1490.90274OpenAlexW3045868168MaRDI QIDQ2150784
Publication date: 30 June 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03742-1
Karush-Kuhn-Tucker optimality conditionsconstraint qualificationsvanishing constraintsMond-Weir dualityWolfe dualitymultiobjective semi-infinite programming
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints, On optimality conditions and duality for multiobjective optimization with equilibrium constraints, Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data, On directionally differentiable multiobjective programming problems with vanishing constraints, Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints, Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: critical point theory
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Recent contributions to linear semi-infinite optimization: an update
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- A duality theorem for non-linear programming
- 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
- Convex Analysis
- Set-valued analysis
- A dual parametrization method for convex semi-infinite programming
- On linear and linearized generalized semi-infinite optimization problems
