Optimality and duality with respect to b-(E,m)-convex programming
Summary: Noticing that \(\mathcal{E}\)-convexity, \(m\)-convexity and \(b\)-invexity have similar structures in their definitions, there are some possibilities to treat these three class of mappings uniformly. For this purpose, the definitions of the \((\mathcal{E}, m)\)-convex sets and the \(b\)-\((\mathcal{E}, m)\)-convex mappings are introduced. The properties concerning operations that preserve the \((\mathcal{E}, m)\)-convexity of the proposed mappings are derived. The unconstrained and inequality constrained \(b\)-\((\mathcal{E}, m)\)-convex programming are considered, where the sufficient conditions of optimality are developed and the uniqueness of the solution to the \(b\)-\((\mathcal{E}, m)\)-convex programming are investigated. Furthermore, the sufficient optimality conditions and the Fritz-John necessary optimality criteria for nonlinear multi-objective \(b\)-\((\mathcal{E}, m)\)-convex programming are established. The Wolfe-type symmetric duality theorems under the \(b\)-\((\mathcal{E}, m)\)-convexity, including weak and strong symmetric duality theorems, are also presented. Finally, we construct two examples in detail to show how the obtained results can be used in \(b\)-\((\mathcal{E}, m)\)-convex programming.
- Optimality and mixed duality in multiobjective \(E\)-convex programming
- Optimality conditions in sub-\((b,m)\)-convex programming
- B-semi- (E,F)-convex functions and programming
- Optimality and Wolfe type duality on multi-objective programming under E-convexity
- On symmetric duality in mathematical programming with (b, F)- convexity
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- A combined interactive approach for solving E-convex multiobjective nonlinear programming problem
- B-vex functions
- Characterizations of geodesic sub-\(b\)-\(s\)-convex functions on Riemannian manifolds
- Generalizations of \(E\)-convex and B-vex functions
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Nondifferentiable higher order symmetric duality under invexity/generalized invexity
- Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions
- On \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- On geodesic \(E\)-convex sets, geodesic \(E\)-convex functions and \(E\)-epigraphs
- On properties of geodesic semilocal E-preinvex functions
- On some characterizations of sub-\(b\)-\(s\)-convex functions
- Optimality and mixed duality in multiobjective \(E\)-convex programming
- Optimality conditions in sub-\((b,m)\)-convex programming
- Parametric approach to multitime multiobjective fractional variational problems under (F,)-convexity
- Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems
- Roughly \(B\)-invex programming problems
- Some properties of geodesic semi E-b-vex functions
- Some properties of semi \(E-b\)-vex functions
This page was built for publication: Optimality and duality with respect to \(b\)-\((\mathcal{E},m)\)-convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337889)
