Robust mathematical programming problems involving vanishing constraints via strongly invex functions
From MaRDI portal
Publication:6564858
DOI10.1007/S40840-024-01721-4MaRDI QIDQ6564858
Izhar Ahmad, Krishna Kummari, Rekha R. Jaichander
Publication date: 1 July 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Convexity of real functions in one variable, generalizations (26A51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On duality for mathematical programs with vanishing constraints
- Exact penalty results for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Robust multiobjective optimization with application to Internet routing
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
- The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- 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
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
- Mathematical programs with vanishing constraints involving strongly invex functions
- A duality theorem for non-linear programming
- Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
- On Perspective Functions and Vanishing Constraints in Mixed-Integer Nonlinear Optimal Control
This page was built for publication: Robust mathematical programming problems involving vanishing constraints via strongly invex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564858)