scientific article; zbMATH DE number 3662118

Cited in

(only showing first 100 items - show all)

Axiomatic approach to approximate solutions in multiobjective optimization
Tradeoff-based decomposition and decision-making in multiobjective programming
Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
\(\epsilon\)-solutions in vector minimization problems
A generalization of the Fenchel-Moreau theorem
A survey of vector optimization in infinite-dimensional spaces. II
V-subdifferentials of convex operators
Approximation in multiobjective optimization
Limiting behavior of the approximate second-order subdifferential of a convex function
Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Decision uncertainty in multiobjective optimization
Borwein-Preiss vector variational principle
Approximate optimality conditions for composite convex optimization problems
Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
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
Coradiant-valued maps and approximate solutions in variable ordering structures
Approximate solutions of vector optimization problems via improvement sets in real linear spaces
-optimality and duality for multiobjective fractional programming
Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
Equivalent -efficiency notions in vector optimization
Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
Ekeland variational principles involving set perturbations in vector equilibrium problems
Advancing local search approximations for multiobjective combinatorial optimization problems
The extremal structure of convex sets of multilinear operators
A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
Hadamard well-posed vector optimization problems
\(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
Sequential -subdifferential calculus for scalar and vector mappings
\(\varepsilon k^ 0\)-subdifferentials of convex functions
Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems
Existence and optimality conditions for approximate solutions to vector optimization problems
\(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
Exact generation of epsilon-efficient solutions in multiple objective programming
Optimality conditions for metrically consistent approximate solutions in vector optimization
Cone characterizations of approximate solutions in real vector optimization
A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
A kind of unified super efficiency via assumption (A) and applications in vector optimization
A combined scalarization method for multi-objective optimization problems
A note on approximate proper efficiency in linear fractional vector optimization
Approximate properly solutions of constrained vector optimization with variable coradiant sets
A combined scalarizing method for multiobjective programming problems
On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
Image space analysis and scalarization for -optimization of multifunctions
\(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
A unified stability result with perturbations in vector optimization
On approximating weakly/properly efficient solutions in multi-objective programming
Pointwise well-posedness in set optimization with cone proper sets
Refinements of -duality theorems for a nonconvex problem with an infinite number of constraints
ANOVA-MOP: ANOVA decomposition for multiobjective optimization
Approximate Lagrangian duality and saddle point optimality in set optimization
A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
Characterization of approximate solutions of vector optimization problems with a variable order structure
Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
Concepts for approximate solutions of vector optimization problems with variable order structures
Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems
Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization
Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
Approximate quasi solutions of multiobjective optimization problems
Exact and approximate vector Ekeland variational principles
A Vectorization Scheme for Nonconvex Set Optimization Problems
Approximate elements for set optimization problems with respect to variable domination structures
Covers and approximations in multiobjective optimization
Limit behavior of approximate proper solutions in vector optimization
Approximation of weak efficient solutions in vector optimization
Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
Approximate weak minimal solutions of set-valued optimization problems
Well-posedness and existence for the weak multicriteria Nash equilibrium of multicriteria games
A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
Set-valued pseudo-metric families and Ekeland's variational principles in fuzzy metric spaces
A general representation of \(\delta\)-normal sets to sublevels of convex functions
Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
On two vectorization schemes for set-valued optimization
Improved feasible value constraint for multiobjective optimization problems
Pascoletti-Serafini scalarizations for approximate quasi efficient solutions for multiobjective optimization problems
Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
Local convex analysis
Lipschitz continuity of V-subdifferentials of convex operators
A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains
On approximate efficiency in multiobjective programming
On approximate solutions in vector optimization problems via scalarization
Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
\(E\)-super efficiency of set-valued optimization problems involving improvement sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3860434)