On approximate efficiency in multiobjective programming
From MaRDI portal
Recommendations
- ε-approximate solutions in multiobjective optimization
- Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
- Epsilon approximate solutions for multiobjective programming problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
Cites work
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 912668 (Why is no real title available?)
- scientific article; zbMATH DE number 5066294 (Why is no real title available?)
- A generalization of ekellandz’s variational principle
- A nonconvex vector minimization problem
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
- Approximate saddle-point theorems in vector optimization
- Approximation of solutions for location problems
- Epsilon approximate solutions for multiobjective programming problems
- Epsilon efficiency
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Approximate Solutions in Convex Vector Optimization
- On approximate solutions in vector optimization problems via scalarization
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On several concepts for \(\varepsilon\)-efficiency
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- On two generalizations of Pareto minimality
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- Relationships between efficient set and -efficient set
- Second order necessary conditions in set constrained differentiable vector optimization
- Stability for convex vector optimization problems
- Vector variational principles; -efficiency and scalar stationarity
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- -duality theorem of nondifferentiable nonconvex multiobjective programming
- -optimality for bicriteria programs and its application to minimum cost flows
- -optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
Cited in
(57)- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- Stability properties of KKT points in vector optimization
- Coradiant-valued maps and approximate solutions in variable ordering structures
- On proper separation of convex sets
- Duality related to approximate proper solutions of vector optimization problems
- Linear and nonlinear scalarization methods for vector optimization problems with variable ordering structures
- Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces
- Second-order optimality conditions for set optimization using coradiant sets
- scientific article; zbMATH DE number 5172380 (Why is no real title available?)
- On approximate starshapedness in multiobjective optimization
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
- On efficiency and duality for multiobjective programs
- scientific article; zbMATH DE number 5003796 (Why is no real title available?)
- Further results on quasi efficient solutions in multiobjective optimization
- Equivalent -efficiency notions in vector optimization
- A Brézis-Browder principle on partially ordered spaces and related ordering theorems
- Limit behavior of approximate proper solutions in vector optimization
- On approximating weakly/properly efficient solutions in multi-objective programming
- Ekeland variational principles involving set perturbations in vector equilibrium problems
- Scalarization and well-posedness for set optimization using coradiant sets
- Exact generation of epsilon-efficient solutions in multiple objective programming
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems
- Lagrange multiplier rules for weak approximate Pareto solutions to constrained vector optimization problems with variable ordering structures
- Improvement sets and vector optimization
- Properties of the nonlinear scalar functional and its applications to vector optimization problems
- Equilibrium set-valued variational principles and the lower boundedness condition with application to psychology
- Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Cone characterizations of approximate solutions in real vector optimization
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Optimality conditions for quasi proper solutions in multiobjective optimization with a polyhedral cone
- Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- Improving the min-max method for multiobjective programming
- An approximation method for the efficiency set of multiobjective programming problems
- On several concepts for \(\varepsilon\)-efficiency
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Generalized Gerstewitz's functions and vector variational principle for \(\epsilon\)-efficient solutions in the sense of Németh
- Approximation methods in multiobjective programming
- Approximate proper efficiency in vector optimization
- Ekeland variational principles for set-valued functions with set perturbations
- scientific article; zbMATH DE number 4119963 (Why is no real title available?)
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Scalarization and well-posedness for set optimization problems involving general set less relations
- Approximability and Hardness in Multi-objective Optimization
This page was built for publication: On approximate efficiency in multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857826)
