Generalized convexity and vector optimization.
From MaRDI portal
Publication:625355
Convexity of real functions of several variables, generalizations (26B25) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Axiomatic and generalized convexity (52A01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Mathematical programming (90Cxx)
Cited in
(25)- Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions
- Duality results for fractional variational problems and its application
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
- Observational nonidentifiability, generalized likelihood and free energy
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- V-invex functions and vector optimization.
- Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
- Optimality conditions in a vector continuous-time optimization problem
- Role of ( , , A)-invexity to -optimality conditions for multiple objective fractional programming
- Convex Parametric Programming in Abstract Spaces
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
- Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
- Optimality for E-\([0,1]\) convex multi-objective programming
- Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems
- Wolfe type duality for nonsmooth optimization problems with vanishing constraints
- On the applications of nonsmooth vector optimization problems to solve generalized vector variational inequalities using convexificators
- Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions
- Karush-Kuhn-Tuckert based global optimization algorithm design for solving stability torque allocation of distributed drive electric vehicles
- On a class of multiple objective variational control models determined by univex functionals
- Optimality and duality for exponentially roughly B-invex multi-objective optimization problems
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
- Generalized convexity and optimization. Theory and applications
- Generalized convexity and vector optimization
This page was built for publication: Generalized convexity and vector optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625355)
