Some properties of approximate solutions for vector optimization problem with set-valued functions
From MaRDI portal
Publication:969737
DOI10.1007/s10898-009-9452-9zbMath1219.90158OpenAlexW2047255790MaRDI QIDQ969737
Publication date: 7 May 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9452-9
vector optimizationscalarizationapproximate solutionset-valued functionquasiconvex set-valued function
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (24)
Generic stability of the solution mapping for set-valued optimization problems ⋮ Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ Continuity of solution mappings for parametric generalized set-valued weak vector equilibrium problems ⋮ A new kind of inner superefficient points ⋮ Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Approximate weak minimal solutions of set-valued optimization problems ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Some characterizations of the approximate solutions to generalized vector equilibrium problems ⋮ Hadamard well-posedness for a set-valued optimization problem ⋮ Optimality conditions and scalarization of approximate quasi weak efficient solutions for vector equilibrium problem ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Approximate proper efficiency in vector optimization ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Set optimization using improvement sets ⋮ Second-order characterizations for set-valued equilibrium problems with variable ordering structures ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ Approximate proper efficiency for multiobjective optimization problems ⋮ Semicontinuity of Approximate Solution Mappings to Parametric Set-Valued Weak Vector Equilibrium Problems ⋮ Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- Characterization of solid cones
- Epsilon efficiency
- Images of connected sets by semicontinuous multifunctions
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Stability results for approximately efficient solutions
- A nonlinear scalarization function and generalized quasi-vector equilibrium problems
- Ordered linear spaces
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- A saddlepoint theorem for set-valued maps
- An Existence Theorem in Vector Optimization
- On Approximate Solutions in Convex Vector Optimization
- Approximately Efficient Solutions in Vector Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- e-weak minimal solutions of vector optimization problems with set-valued maps
This page was built for publication: Some properties of approximate solutions for vector optimization problem with set-valued functions
