Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
From MaRDI portal
Publication:2168778
DOI10.1007/s10288-021-00482-1zbMath1505.90117OpenAlexW3166163489MaRDI QIDQ2168778
Publication date: 26 August 2022
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-021-00482-1
invex functionMond-Weir dualityKarush-Kunh-Tucker optimality conditionsemi-infinite multiobjective programming problemvanishing constraint
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (4)
Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing 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 ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality for mathematical programs with vanishing constraints
- Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions
- Mathematical programs with vanishing constraints: critical point theory
- Generalized convexity and vector optimization.
- Semi-infinite programming
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Theory of multiobjective optimization
- Optimality conditions in multiobjective differentiable programming
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On sufficiency of the Kuhn-Tucker conditions
- Invex functions and generalized convexity in multiobjective programming
- Nonlinear multiobjective optimization
- 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
- The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Semi-infinite fractional programming
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Vector optimization. Set-valued and variational analysis.
- Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
- On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
- On semi-infinite minmax programming with generalized invexity
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- What is invexity?
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
- Sufficient optimality conditions for semi-infinite multiobjective fractional programming under (Ф,ρ)-V-invexity and generalized (Ф,ρ)-V-invexity
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Finite dimensional convexity and optimization
This page was built for publication: Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
