Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
From MaRDI portal
Publication:2392756
DOI10.1007/S10898-011-9822-YzbMATH Open1291.90285OpenAlexW2007829500MaRDI QIDQ2392756FDOQ2392756
Authors: Elvira Hernández, Fabián Flores-Bazan 
Publication date: 2 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/128149
Recommendations
- A unified vector optimization problem: complete scalarizations and applications
- Some properties of efficient solutions for vector optimization
- Optimality conditions for strictly efficient solutions of nondifferentiable vector optimization problem
- First and second order optimality conditions in vector optimization problems with nontransitive preference relation
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
efficiencyoptimality conditionssubdifferentialscalarizationvector optimizationweak efficiencystrict efficiencyapproximate efficiency
Cites Work
- Vector equilibrium problems with generalized monotone bifunctions
- Variational methods in partially ordered spaces
- Title not available (Why is that?)
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Scalarizing vector optimization problems
- On three concepts of quasiconvexity in vector optimization
- Vector optimization. Set-valued and variational analysis.
- A unified vector optimization problem: complete scalarizations and applications
- Adaptive Scalarization Methods in Multiobjective Optimization
- Lipschitz properties of the scalarization function and applications
- Fuzzy necessary optimality conditions for vector optimization problems
- Radial Epiderivatives and Asymptotic Functions in Nonconvex Vector Optimization
- A characterization of quasiconvex vector-valued functions
- Nonconvex separation theorems and some applications in vector optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Optimality conditions for several types of efficient solutions of set-valued optimization problems
- Title not available (Why is that?)
- On approximate solutions in vector optimization problems via scalarization
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Minimax type theorems for n-valued functions
- Characterizing efficiency without linear structure: a unified approach
- An optimal alternative theorem and applications to mathematical programming
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Title not available (Why is that?)
- Ideal, weakly efficient solutions for vector optimization problems
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Existence of equilibria when firms follow bounded losses pricing rules
- Generalized Quasiconvex Mappings and Vector Optimization
- Semistrictly quasiconvex mappings and non-convex vector optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizing the efficient points without closedness or free-disposability
Cited In (24)
- A kind of unified proper efficiency in vector optimization
- Vector optimization using improvement sets in locally convex spaces
- Characterizing efficiency without linear structure: a unified approach
- Second-order optimality conditions for set optimization using coradiant sets
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Some saddle-point theorems for vector-valued functions
- Existence and characterization theorems in nonconvex vector optimization
- Scalarization and well-posedness for set optimization using coradiant sets
- Unifying local-global type properties in vector optimization
- Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line
- Stability in unified semi-infinite vector optimization
- Improvement sets and vector optimization
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- A survey of set optimization problems with set solutions
- Existence of optimal points via improvement sets
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Set optimization using improvement sets
- A unified vector optimization problem: complete scalarizations and applications
- Extended radial epiderivatives of non-convex vector-valued maps and parametric quasiconvex programming
- First and second order optimality conditions in vector optimization problems with nontransitive preference relation
- Stability and scalarization in vector optimization using improvement sets
This page was built for publication: Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392756)
