On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
Publication:2691484
DOI10.3934/JIMO.2022196OpenAlexW4312688644MaRDI QIDQ2691484
Tadeusz Antczak, A. P. Farajzadeh
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022196
Fritz John necessary optimality conditionspenalized optimization problem with the interval-valued exact absolute value penalty functionKarush-Kuhn-Tucker necessary optimality conditions\(l_1\) exact penalty function method\(LU\)-invex functionexactness of the penalizationsemi-infinite vector interval-valued optimization problem
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on nonlinear programming (49M37) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Semi-infinite programming (90C34)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On interval-valued invex mappings and optimality conditions for interval-valued optimization problems
- A new exact penalty method for semi-infinite programming problems
- Nonsmooth interval-valued optimization and saddle-point optimality criteria
- Semi-infinite programming
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Exact penalty functions method for mathematical programming problems involving invex functions
- Optimality conditions and duality results for nonsmooth vector optimization problems with the multiple interval-valued objective function
- Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Optimality conditions and duality in nondifferentiable interval-valued programming
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Characterization results of solutions in interval-valued optimization problems with mixed constraints
- An exact \(l_1\) penalty approach for interval-valued programming problem
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- Interval-valued programming problem with infinite constraints
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- On interval-valued optimization problems with generalized invex functions
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- The Exactness Property of the Vector Exact l1 Penalty Function Method in Nondifferentiable Invex Multiobjective Programming
- Nonsmooth invexity
- Optimization and nonsmooth analysis
- What is invexity?
- An exact penalty function for semi-infinite programming
- A lower bound for the controlling parameters of the exact penalty functions
- Numerical Optimization
- Exact Penalty Functions in Constrained Optimization
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- Sufficiency of Exact Penalty Minimization
- Nonlinear Programming
- Generalized convexity in multiobjective programming
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Semi-infinite programming. Recent advances
This page was built for publication: On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
