Bicriteria linear fractional programming
From MaRDI portal
Cites work
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- A revised simplex method for linear multiple objective programs
- Bicriteria Transportation Problem
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Generating all maximal efficient faces for multiple objective linear programs
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Programming with linear fractional functionals
- Proper efficiency and the theory of vector maximization
- Solving Bicriterion Mathematical Programs
- Technical Note—Parametric Solution of a Class of Nonconvex Programs
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The structure of admissible points with respect to cone dominance
- Vector maximization with two objective functions
Cited in
(37)- Ranking of vertices in the linear fractional programming problem
- A class of multiple-criteria fractional programming problems
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Connectedness of the efficient set of strictly quasiconcave sets
- Multiple objective linear fractional programming. -- A fuzzy set theoretic approach
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- Fuzzy mathematical programming for multi objective linear fractional programming problem
- Affine variational inequalities on normed spaces
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- Interior efficient solutions in bicriterion linear fractional programming -- A geometric approach
- Acceleration procedure for special classes of multi-extremal problems
- Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets
- Improperly efficient solutions in a class of vector optimization problems
- On stability of proper efficient solutions in multiobjective fractional programming problems under fuzziness
- 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
- A property of bicriteria affine vector variational inequalities
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
- Bibliography in fractional programming
- Connectedness of the efficient solution set of a convex vector optimization in normed spaces
- Multi-criteria integer linear fractional programming problem
- Bicriterion integer linear fractional programs with parameters in the objective functions
- Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line
- New results on proper efficiency for a class of vector optimization problems
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- Connectedness structure of the solution sets of vector variational inequalities
- Constrained integer linear fractional programming problem
- Proper efficiency in linear fractional vector optimization via Benson's characterization
- Fractional programming
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- A linear programming approach to test efficiency in multi-objective linear fractional programming problems
- Maximizing a linear fractional function on a Pareto efficient frontier
- Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces
- A compromise procedure for the multiple objective linear fractional programming problem
- Unbounded components in the solution sets of strictly quasiconcave vector maximization problems
This page was built for publication: Bicriteria linear fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148820)
