Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints
From MaRDI portal
Publication:6125399
DOI10.1007/s40314-023-02569-3OpenAlexW4390971871WikidataQ129964517 ScholiaQ129964517MaRDI QIDQ6125399
Publication date: 11 April 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-023-02569-3
Convex programming (90C25) Nonlinear programming (90C30) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Cites Work
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Mathematical programs with vanishing constraints: critical point theory
- Nonsmooth interval-valued optimization and saddle-point optimality criteria
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Generalized semi-infinite programming: a tutorial
- Generalized semi-infinite optimization: A first order optimality condition and examples
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Directional differentiability of the optimal value function in convex semi-infinite programming
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- Optimality and duality in non-differentiable interval valued multiobjective programming
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Optimality conditions for the efficient solutions of vector equilibrium problems with constraints in terms of directional derivatives and applications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- On optimality conditions and duality results in a class of nonconvex quasidifferentiable optimization problems
- Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
- Optimality conditions for non-smooth semi-infinite programming
- Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- A duality theorem for semi-infinite convex programs and their finite subprograms
- Optimality conditions for nondifferentiable convex semi-infinite programming
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
- Convex Analysis
- Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
- A dual parametrization method for convex semi-infinite programming
This page was built for publication: Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints
