ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
From MaRDI portal
Publication:2785241
DOI10.1081/NFA-100108312zbMath1052.90075MaRDI QIDQ2785241
No author found.
Publication date: 2001
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (45)
On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ A combined scalarizing method for multiobjective programming problems ⋮ Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ On approximate efficiency in multiobjective programming ⋮ Variational convergence for vector-valued functions and its applications to convex multiobjective optimization ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Optimality conditions for approximate solutions in multiobjective optimization problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ Lagrange multipliers in convex set optimization with the set and vector criteria ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Optimality via generalized approximate convexity and quasiefficiency ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Two Types of Approximate Saddle Points ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ On a practical notion of Geoffrion proper optimality in multicriteria optimization ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Some properties of approximate solutions for vector optimization problem with set-valued functions ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ On approximate starshapedness in multiobjective optimization ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ E-Benson proper efficiency in vector optimization ⋮ Saddle points and Pareto points in multiple objective programming ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization ⋮ Approximate solutions of multiobjective optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability.
- \(\epsilon\)-solutions in vector minimization problems
- Scalarization of vector optimization problems
- Some more density results for proper efficiencies
- Connectedness of the efficient set for three-objective quasiconcave maximization problems
- Arcwise connectedness of closed efficient point sets
- Convex analysis and nonlinear optimization. Theory and examples
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Second order optimality conditions for differentiable multiobjective problems
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- On Approximate Solutions in Convex Vector Optimization
This page was built for publication: ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
