Connectedness in Multiple Linear Fractional Programming
From MaRDI portal
Cited in
(24)- On efficient sets in vector maximum problems - A brief survey
- On the use of multiple objective linear programming algorithms to solve problems with fractional objectives
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Connectedness of the efficient set of strictly quasiconcave sets
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- New closedness results for efficient sets in multiple objective mathematical programming
- Contractibility and connectedness of efficient point sets
- Affine variational inequalities on normed spaces
- On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010
- Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets
- Improperly efficient solutions in a class of vector optimization problems
- Contractibility of the solution sets in strictly quasiconcave vector maximization on noncompact domains
- A note on approximate proper efficiency in linear fractional vector optimization
- Monotone affine vector variational inequalities
- An introduction to vector variational inequalities and some new results
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
- Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions
- New results on proper efficiency for a class of vector optimization problems
- Connectedness structure of the solution sets of vector variational inequalities
- Contractibility of efficient point sets in normed spaces
- Proper efficiency in linear fractional vector optimization via Benson's characterization
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Unbounded components in the solution sets of strictly quasiconcave vector maximization problems
This page was built for publication: Connectedness in Multiple Linear Fractional Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670918)
