Epsilon efficiency
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3837946 (Why is no real title available?)
- scientific article; zbMATH DE number 3545267 (Why is no real title available?)
- scientific article; zbMATH DE number 3433785 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- Characterizations of efficient sets by constrained objectives
- Duality theory in multiobjective programming
- Multi-objective infinite-horizon discounted Markov decision processes
Cited in
(89)- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
- Image space analysis and scalarization for -optimization of multifunctions
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Relationships between efficient set and -efficient set
- Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems
- ε-approximate solutions in multiobjective optimization
- Bilevel programming for generating discrete representations in multiobjective optimization
- Multi-objective shape optimization of TESLA-like cavities: addressing stochastic Maxwell's eigenproblem constraints
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- Approximate proper efficiency for multiobjective optimization problems
- Approximate elements for set optimization problems with respect to variable domination structures
- Strict approximate duality in vector spaces
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Constructing a set of effective vectors by \(\varepsilon\)-perturbations method
- Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors
- The maximization of a function over the efficient set via a penalty function approach
- Techniques for exploring the suboptimal set
- Equivalent -efficiency notions in vector optimization
- A combined scalarizing method for multiobjective programming problems
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
- Limit behavior of approximate proper solutions in vector optimization
- On approximating weakly/properly efficient solutions in multi-objective programming
- Approximate saddle points for constrained vector-valued games.
- Ekeland variational principles involving set perturbations in vector equilibrium problems
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- Approximate saddle points for minmax problems and vector valued games.
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Control problems driven by approximately pseudo-convex multiple integral functionals
- Optimality conditions for approximate solutions in multiobjective optimization problems
- ANOVA-MOP: ANOVA decomposition for multiobjective optimization
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
- \(E\)-Benson proper efficiency in vector optimization
- An iterative approach to solve multiobjective linear fractional programming problems
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- On approximate solutions in vector optimization problems via scalarization
- Speed optimizations for liner networks with business constraints
- On approximate efficiency in multiobjective programming
- The multicriteria big cube small cube method
- Approximate quasi solutions of multiobjective optimization problems
- Properties of the nonlinear scalar functional and its applications to vector optimization problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
- Concepts for approximate solutions of vector optimization problems with variable order structures
- Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Cone characterizations of approximate solutions in real vector optimization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Tracking error/control effort trade-off in the presence of disturbance
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Parametric characterization of approximate quasi solutions in the class of quasidifferentiable multiobjective fractional programming problems
- Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
- On approximate efficiency for nonsmooth robust vector optimization problems
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- A multiple objective interactive Lagrangean relaxation approach
- Generation of efficient and ε -efficient solutions in multiple objective linear programming
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Characterizing \(\varepsilon\)-properly efficient solutions
- Tradeoff-based decomposition and decision-making in multiobjective programming
- Approximation in multiobjective optimization
- Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling
- A unified vector optimization problem: complete scalarizations and applications
- On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
- On several concepts for \(\varepsilon\)-efficiency
- Convergence of relaxed minimizers in set optimization
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- Two Types of Approximate Saddle Points
- -optimality for bicriteria programs and its application to minimum cost flows
- Approximate properly solutions of constrained vector optimization with variable coradiant sets
- Covers and approximations in multiobjective optimization
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Approximate proper efficiency in vector optimization
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- scientific article; zbMATH DE number 4119963 (Why is no real title available?)
- A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Stability of minimizers of set optimization problems
- Pascoletti-Serafini scalarizations for approximate quasi efficient solutions for multiobjective optimization problems
- Epsilon Calculi
This page was built for publication: Epsilon efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062919)
