\(\epsilon\)-solutions in vector minimization problems
From MaRDI portal
Publication:1053611
DOI10.1007/BF00936165zbMath0517.90074MaRDI QIDQ1053611
Publication date: 1984
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Ekeland's variational principleepsilon-efficient pointsepsilon-Pareto solutionepsilon-solutionsvector minimization
Related Items
Using KKM technique in set-valued optimization problems and variational-like inequalities ⋮ Stability of minimizers of set optimization problems ⋮ Approximate weakly efficient solutions of set-valued vector equilibrium problems ⋮ Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ \(\varepsilon k^ 0\)-subdifferentials of convex functions ⋮ Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ On the existence and stability of approximate solutions of perturbed vector equilibrium problems ⋮ A generalized Ekeland vector variational principle and its applications in optimization ⋮ A combined scalarizing method for multiobjective programming problems ⋮ Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ On two generalizations of Pareto minimality ⋮ A new maximal point theorem ⋮ On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity ⋮ The Ekeland variational principle for Henig proper minimizers and super minimizers ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ Variational convergence for vector-valued functions and its applications to convex multiobjective optimization ⋮ Strict approximate duality in vector spaces ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ ∊-gradients pour les ponctions localements lipschitziennes et applications ⋮ A new kind of inner superefficient points ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions ⋮ Improving the min-max method for multiobjective programming ⋮ An approximation method for the efficiency set of multiobjective programming problems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ A combined scalarization method for multi-objective optimization problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ Approximating the Pareto optimal set using a reduced set of objective functions ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ Borwein-Preiss vector variational principle ⋮ A topological convergence on power sets well-suited for set optimization ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ On the equilibria of generalized dynamical systems ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ Computing the Set of Approximate Solutions of a Multi-objective Optimization Problem by Means of Cell Mapping Techniques ⋮ Convergence of relaxed minimizers in set optimization ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ A generalization of ekellandz’s variational principle ⋮ Two Types of Approximate Saddle Points ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Versions of Ekeland's variational principle involving set perturbations ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ On approximate solutions in set-valued optimization problems ⋮ Unnamed Item ⋮ Characterization of approximate solutions of vector optimization problems with a variable order structure ⋮ A kind of unified proper efficiency in vector optimization ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Robust multiobjective optimization with application to Internet routing ⋮ Ekeland's variational principle and its equivalent theorems in vector optimization ⋮ Concepts for approximate solutions of vector optimization problems with variable order structures ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Approximate saddle points for constrained vector-valued games. ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Covers and approximations in multiobjective optimization ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ Solving multiobjective programming problems by discrete representation ⋮ A pre-order principle and set-valued Ekeland variational principle ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization ⋮ ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION ⋮ εVariational inequalities for vector approximation problems ⋮ Stability of solution mappings for parametric bilevel vector equilibrium problems ⋮ Vector optimization with generalized cone locally connected functions ⋮ A Characterization of Approximate Solutions of Multiobjective Stochastic Optimal Control Problems ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ Choquet boundaries and efficiency ⋮ Approximate proper efficiency in vector optimization ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ Lipschitz continuity of an approximate solution mapping for parametric set-valued vector equilibrium problems ⋮ \(\varepsilon\)-optimality and duality for multiobjective fractional programming ⋮ On approximate starshapedness in multiobjective optimization ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ Pareto optimizing and scalarly stationary sequences ⋮ Convergence of minimal and approximate minimal elements of sets in partially ordered vector spaces ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming ⋮ Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ Generalized variational principle and vector optimization ⋮ ε-approximate solutions in multiobjective optimization ⋮ Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems ⋮ Generalized \({\varepsilon }\)-quasi solutions of set optimization problems ⋮ Approximate solutions of multiobjective optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems ⋮ Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ Approximate solutions of interval-valued optimization problems ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Scalarization in vector optimization with arbitrary domination sets ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Levitin-Polyak well-posedness for lexicographic vector equilibrium problems ⋮ An ε-Minimax Theorem for Bi-Lower-Semicontinuous Set-Valued Mappings ⋮ ∊-Variational inequalities in partially ordered spaces ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Generation of efficient and ε -efficient solutions in multiple objective linear programming ⋮ Optimality, scalarization and duality in linear vector semi-infinite programming ⋮ e-weak minimal solutions of vector optimization problems with set-valued maps ⋮ Vector-valued variational principle in fuzzy metric space and its applications ⋮ Unnamed Item ⋮ Well-Posedness for Lexicographic Vector Equilibrium Problems ⋮ Unnamed Item ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ A New Variant of Ekeland's Variational Principle for Set-Valued Maps ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Between Pareto efficiency and Pareto ε-efficiency ⋮ On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization ⋮ Methods for Multiobjective Bilevel Optimization ⋮ Approximate proper efficiency for multiobjective optimization problems
Cites Work
