Epsilon efficiency

From MaRDI portal
Publication:1062919


DOI10.1007/BF00940762zbMath0573.90085MaRDI QIDQ1062919

Douglas J. White

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)


90C31: Sensitivity, stability, parametric optimization

90B50: Management decision making, including multiple objectives

90C40: Markov and semi-Markov decision processes


Related Items

Approximate Saddle Point and Duality for Multiobjective n-Set Optimization, A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy, E-Benson proper efficiency in vector optimization, ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function, ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps, On Minty variational principle for nonsmooth vector optimization problems with approximate convexity, A combined scalarizing method for multiobjective programming problems, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions, \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints, Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems, On approximating weakly/properly efficient solutions in multi-objective programming, 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, Covers and approximations in multiobjective optimization, Optimality conditions for approximate solutions in multiobjective optimization problems, The multicriteria big cube small cube method, A generic approach to approximate efficiency and applications to vector optimization with set-valued maps, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A multiple objective interactive Lagrangean relaxation approach, Generating \(\varepsilon\)-efficient solutions in multiobjective programming, On approximate efficiency in multiobjective programming, On approximate solutions in vector optimization problems via scalarization, Some properties of approximate solutions for vector optimization problem with set-valued functions, Tradeoff-based decomposition and decision-making in multiobjective programming, Strict approximate duality in vector spaces, Approximation in multiobjective optimization, The maximization of a function over the efficient set via a penalty function approach, Epsilon-dominating solutions in mean-variance portfolio analysis, Bilevel programming for generating discrete representations in multiobjective optimization, Convergence of relaxed minimizers in set optimization, Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity, Equivalent \(\varepsilon\)-efficiency notions in vector optimization, Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems, Stability of minimizers of set optimization problems, Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization, 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, 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, Approximate saddle points for minmax problems and vector valued games., 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, Approximate proper efficiency in vector optimization, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Characterizing ϵ-properly efficient solutions, A unified vector optimization problem: complete scalarizations and applications, Two Types of Approximate Saddle Points, ε-approximate solutions in multiobjective optimization



Cites Work