Epsilon efficiency
From MaRDI portal
Publication:1062919
DOI10.1007/BF00940762zbMath0573.90085OpenAlexW2914548405MaRDI QIDQ1062919
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940762
vector optimizationMarkov decision processespenalty functionsefficient solutionefficient setsweighting factorsideal pointsconstrained objectivesepsilon-optimality
Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Markov and semi-Markov decision processes (90C40)
Related Items (73)
Stability of minimizers of set optimization problems ⋮ On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ A combined scalarizing method for multiobjective programming problems ⋮ On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ On approximate efficiency in multiobjective programming ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ Strict approximate duality in vector spaces ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions ⋮ Approximate elements for set optimization problems with respect to variable domination structures ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ 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 ⋮ The multicriteria big cube small cube method ⋮ Speed optimizations for liner networks with business constraints ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ Convergence of relaxed minimizers in set optimization ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ 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 ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ Approximate properly solutions of constrained vector optimization with variable coradiant sets ⋮ A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy ⋮ Unnamed Item ⋮ 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 ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Generation of efficient and ε -efficient solutions in multiple objective linear programming ⋮ Exact generation of epsilon-efficient solutions in multiple objective programming ⋮ Approximation in multiobjective optimization ⋮ Approximate saddle points for constrained vector-valued games. ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ Covers and approximations in multiobjective optimization ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ Approximate saddle points for minmax problems and vector valued games. ⋮ A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization ⋮ Some properties of approximate solutions for vector optimization problem with set-valued functions ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ Ekeland variational principles involving set perturbations in vector equilibrium problems ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ Approximate proper efficiency in vector optimization ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems ⋮ 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 ⋮ The maximization of a function over the efficient set via a penalty function approach ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ Limit Behavior of Approximate Proper Solutions in Vector Optimization ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming ⋮ Epsilon-dominating solutions in mean-variance portfolio analysis ⋮ E-Benson proper efficiency in vector optimization ⋮ ε-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 in multiobjective optimization ⋮ A multiple objective interactive Lagrangean relaxation approach ⋮ Approximate proper efficiency for multiobjective optimization problems ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
Cites Work
This page was built for publication: Epsilon efficiency
