Optimality conditions for quasi-solutions of vector optimization problems
DOI10.1007/S10957-013-0393-6zbMATH Open1374.90338OpenAlexW2039887265MaRDI QIDQ261981FDOQ261981
V. Novo, C. Gutiérrez, B. Jiménez
Publication date: 29 March 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0393-6
approximate solutioncoradiant setfree disposal setlimiting subdifferentialminimal quasi-solutionmultiplier rulesscalarizationvector optimization problem
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)
Cites Work
- Variational methods in partially ordered spaces
- On the variational principle
- Title not available (Why is that?)
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Vector variational principle
- Near-subconvexlikeness in vector optimization with set-valued functions
- Improvement sets and vector optimization
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Lagrange multiplier rules for approximate solutions in vector optimization
- Vector optimization. Set-valued and variational analysis.
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- A new notion of quasi efficiency in vector optimization
- Ekeland's Variational Principle for Set-Valued Functions
- Vector Optimization
- A unified vector optimization problem: complete scalarizations and applications
- Vector variational principles for set-valued functions
- Two Types of Approximate Saddle Points
- Lipschitz properties of the scalarization function and applications
- A Set-Valued Ekeland's Variational Principle in Vector Optimization
- Fuzzy necessary optimality conditions for vector optimization problems
- Title not available (Why is that?)
- Nonconvex minimization problems
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Degrees of Efficiency and Degrees of Minimality
- Metric regularity and subdifferential calculus
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- Title not available (Why is that?)
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Nonconvex separation theorems and some applications in vector optimization
- A Brézis-Browder principle on partially ordered spaces and related ordering theorems
- Vector optimization problems via improvement sets
- The Ekeland variational principle for Henig proper minimizers and super minimizers
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
Cited In (14)
- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- Title not available (Why is that?)
- Further results on quasi efficient solutions in multiobjective optimization
- Title not available (Why is that?)
- Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
- Some properties of generalized oriented distance function and their applications to set optimization problems
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- On three concepts of quasiconvexity in vector optimization
- A kind of equivalence of three nonlinear scalarization functions in vector optimization
- Optimality conditions for quasi proper solutions in multiobjective optimization with a polyhedral cone
- Title not available (Why is that?)
- On approximate optimality conditions for robust multi-objective convex optimization problems
- Existence of Solutions of Set Quasi-Optimization Problems Involving Minkowski Difference
Recommendations
- Optimality conditions in quasidifferentiable vector optimization 👍 👎
- Optimality conditions for approximate solutions of vector optimization problems 👍 👎
- On vector quasi-optimization problems 👍 👎
- Optimality conditions for vector optimization problems 👍 👎
- Vector optimization problems with quasiconvex constraints 👍 👎
- Optimality Conditions for Quasiconvex Programs 👍 👎
- On general vector quasi-optimization problems 👍 👎
- Title not available (Why is that?) 👍 👎
- Some Optimality Conditions in Vector Optimization 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Optimality conditions for quasi-solutions of vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q261981)