Criteria of saddle points for the general form of vector optimization problem in complex space
From MaRDI portal
Publication:5865593
DOI10.2298/FIL2001221EMaRDI QIDQ5865593
Publication date: 9 June 2022
Published in: Filomat (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Unnamed Item
- Unnamed Item
- Saddle points for vector valued functions: existence, necessary and sufficient theorems
- On the Fritz John saddle point problem for differentiable multiobjective optimization
- On nonlinear programming in complex spaces
- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- Extension to necessary optimality conditions in complex programming
- Nonlinear programming in complex space: Sufficient conditions and duality
- Efficiency for a generalized form of vector optimization problems in complex space
- Multi-Objective Programming in Complex Space
- Extensions of proper efficiency in complex space
- Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity
- Sufficient optimality conditions for semi-infinite multiobjective fractional programming under (Ф,ρ)-V-invexity and generalized (Ф,ρ)-V-invexity
This page was built for publication: Criteria of saddle points for the general form of vector optimization problem in complex space