Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
From MaRDI portal
Publication:2678851
DOI10.1007/s40314-022-02139-zOpenAlexW4310529451WikidataQ122893477 ScholiaQ122893477MaRDI QIDQ2678851
Publication date: 25 January 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-02139-z
(VC-)KKT type optimality conditionslocally Lu optimal solutionsnonsmooth semi-infinite interval-valued mathematical programming problem with vanishing constraintsupper and lower Hadamard derivativesWolfe and Mond-Weir types dual model
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) General equilibrium theory (91B50)
Related Items
Cites Work
- Unnamed Item
- On duality for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: critical point theory
- About contingent epiderivatives
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Wolfe duality for interval-valued optimization
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Optimality and duality in constrained interval-valued optimization
- On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
- On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
- Vector Optimization
- First order optimality conditions in vector optimization involving stable functions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Convex Analysis
- Set-valued analysis
- Finite dimensional convexity and optimization