New results on proper efficiency for a class of vector optimization problems
DOI10.1080/00036811.2020.1712373zbMath1480.90235OpenAlexW2999972485WikidataQ126359708 ScholiaQ126359708MaRDI QIDQ5164912
Nguyen Thi Thu Huong, Nguyen Dong Yen, Jen-Chih Yao
Publication date: 15 November 2021
Published in: Applicable Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00036811.2020.1712373
efficient solutionrecession conecoincidence of solution setsGeoffrion's properly efficient solutionlinear fractional vector optimization
Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the parametric affine variational inequality approach to linear fractional vector optimization problems
- Unbounded components in the solution sets of strictly quasiconcave vector maximization problems
- Theory of multiobjective optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Bicriteria linear fractional programming
- Connectedness of the efficient set of strictly quasiconcave sets
- Quadratic programming and affine variational inequalities. A qualitative study.
- Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets
- On the existence of Pareto solutions for polynomial vector optimization problems
- Proper efficiency and the theory of vector maximization
- Linear fractional vector optimization problems with many components in the solution sets
- Polynomial Vector Variational Inequalities under Polynomial Constraints and Applications
- Linear Fractional and Convex Quadratic Vector Optimization Problems
- Multiobjective Linear Programming
- Monotone affine vector variational inequalities
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- Connectedness in Multiple Linear Fractional Programming
- Proper Efficient Points for Maximizations with Respect to Cones
- An Application of the Tarski-Seidenberg Theorem with Quantifiers to Vector Variational Inequalities
- Connectedness structure of the solution sets of vector variational inequalities
- Convex Analysis
- A result on vector variational inequalities with polyhedral constraint sets
This page was built for publication: New results on proper efficiency for a class of vector optimization problems