A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
From MaRDI portal
Publication:1413171
DOI10.1016/S0022-247X(03)00469-4zbMath1046.90101MaRDI QIDQ1413171
Publication date: 16 November 2003
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Duality; Mathematical programming; Saddle point; \(B\)-(\(p\),\(r\))-invex function with respect to \({\eta}\) and \(b\)
90C26: Nonconvex programming, global optimization
90C46: Optimality conditions and duality in mathematical programming
Related Items
Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity, A critical view on invexity, Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming, Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity, A class of \(r\)-semipreinvex functions and optimality in nonlinear programming, Nonsmooth multiple-objective optimization in separable Hilbert spaces, Penalty function methods and a duality gap for invex optimization problems, Generalized fractional minimax programming with \(B-(p,r)\)-invexity, Exact penalty functions method for mathematical programming problems involving invex functions, Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity, A class of \(G\)-semipreinvex functions and optimality, Generalized hybrid \(B-(b, \rho, \theta, \tilde{p}, \tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming, Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions, GeneralizedB-(p,r)-Invexity Functions and Nonlinear Mathematical 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
