Generalized convexity and vector optimization.
zbMATH Open1207.49001MaRDI QIDQ625355FDOQ625355
Authors: S. K. Mishra, Shouyang Wang, Kin Keung Lai 
Publication date: 16 February 2011
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) 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) Mathematical programming (90Cxx)
Cited In (23)
- Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
- Karush-Kuhn-Tuckert based global optimization algorithm design for solving stability torque allocation of distributed drive electric vehicles
- Optimality conditions in a vector continuous-time optimization problem
- Convex Parametric Programming in Abstract Spaces
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
- On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators
- Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming
- Generalized convexity and vector optimization
- Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
- Generalized convexity and optimization. Theory and applications
- Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions
- V-invex functions and vector optimization.
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Duality results for fractional variational problems and its application
- Optimality for E-[0,1] convex multi-objective programming
- Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
- Title not available (Why is that?)
- 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
- Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems
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)
