Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
From MaRDI portal
Publication:5005859
DOI10.2298/FIL1703671GzbMath1488.90171OpenAlexW1893332158MaRDI QIDQ5005859
Publication date: 11 August 2021
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1703671g
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (2)
A Newton method for capturing Pareto optimal solutions of fuzzy multiobjective optimization problems ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
Cites Work
- A combined scalarizing method for multiobjective programming problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Optimality conditions for approximate solutions of vector optimization problems
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- On approximate solutions in vector optimization problems via scalarization
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- A modified weighted Tchebycheff metric for multiple objective programming
- Nonlinear multiobjective optimization
- Efficient solutions and bounds on tradeoffs
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Epsilon approximate solutions for multiobjective programming problems
- Proper efficiency and the theory of vector maximization
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Characterizing ϵ-properly efficient solutions
- Recent Developments in Vector Optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- ε-approximate solutions in multiobjective optimization
- On Approximate Solutions in Convex Vector Optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Multicriteria Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
