A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
From MaRDI portal
Publication:1413171
DOI10.1016/S0022-247X(03)00469-4zbMath1046.90101OpenAlexW1968590259MaRDI QIDQ1413171
Publication date: 16 November 2003
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-247x(03)00469-4
DualityMathematical programmingSaddle point\(B\)-(\(p\),\(r\))-invex function with respect to \({\eta}\) and \(b\)
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Nonsmooth multiple-objective optimization in separable Hilbert spaces, Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions, Higher-order non-symmetric duality for nondifferentiable minimax fractional programs with square root terms, \(V-E\)-invexity in \(E\)-differentiable multiobjective programming, A class of \(r\)-semipreinvex functions and optimality in nonlinear programming, A class of \(G\)-semipreinvex functions and optimality, A critical view on invexity, Penalty function methods and a duality gap for invex optimization problems, Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity, Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming, Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity, GeneralizedB-(p,r)-Invexity Functions and Nonlinear Mathematical Programming, Generalized fractional minimax programming with \(B-(p,r)\)-invexity, Generalized hybrid \(B-(b, \rho, \theta, \tilde{p}, \tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming, Exact penalty functions method for mathematical programming problems involving invex functions, New class of \(G\)-Wolfe-type symmetric duality model and duality relations under \(G_f\)-bonvexity over arbitrary cones, Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity, Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity, \(E\)-univex sets, \(E\)-univex functions and \(E\)-differentiable \(E\)-univex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Generalized B-vex functions and generalized B-vex programming
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- \((p,r)\)-invex sets and functions
