Bicriteria linear fractional programming

DOI10.1007/BF00933830zbMath0452.90076MaRDI QIDQ1148820

Eng Ung Choo, Derek Atkins

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmconnectednessefficient frontierefficient pointsbicriteria linear fractional programmingconnected line segmentsfinite unionlinearly constrained setsone-dimensional parametric linear programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32)

Related Items (37)

Proper efficiency in linear fractional vector optimization via Benson's characterization ⋮ Connectedness structure of the solution sets of vector variational inequalities ⋮ On a constructive approximation of the efficient outcomes in bicriterion vector optimization ⋮ A class of multiple-criteria fractional programming problems ⋮ An introduction to vector variational inequalities and some new results ⋮ Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line ⋮ Unbounded components in the solution sets of strictly quasiconcave vector maximization problems ⋮ On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces ⋮ Affine variational inequalities on normed spaces ⋮ A linear programming approach to test efficiency in multi-objective linear fractional programming problems ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ Connectedness of the efficient solution set of a convex vector optimization in normed spaces ⋮ Multi-criteria integer linear fractional programming problem ⋮ Monotone affine vector variational inequalities ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ Fractional programming ⋮ On stability of proper efficient solutions in multiobjective fractional programming problems under fuzziness ⋮ New results on proper efficiency for a class of vector optimization problems ⋮ Contractibility of the solution sets in strictly quasiconcave vector maximization on noncompact domains ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ Bicriterion integer linear fractional programs with parameters in the objective functions ⋮ Acceleration procedure for special classes of multi-extremal problems ⋮ Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces ⋮ Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem ⋮ Constrained integer linear fractional programming problem ⋮ Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ Interior efficient solutions in bicriterion linear fractional programming -- A geometric approach ⋮ Connectedness of the efficient set of strictly quasiconcave sets ⋮ A compromise procedure for the multiple objective linear fractional programming problem ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem ⋮ Ranking of vertices in the linear fractional programming problem ⋮ Multiple objective linear fractional programming. -- A fuzzy set theoretic approach ⋮ Fuzzy mathematical programming for multi objective linear fractional programming problem ⋮ A property of bicriteria affine vector variational inequalities ⋮ Improperly efficient solutions in a class of vector optimization problems ⋮ Bibliography in fractional programming

Cites Work

• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• Vector maximization with two objective functions
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• The structure of admissible points with respect to cone dominance
• Generating all maximal efficient faces for multiple objective linear programs
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Bicriteria Transportation Problem
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• A revised simplex method for linear multiple objective programs
• Programming with linear fractional functionals
• Solving Bicriterion Mathematical Programs
• Technical Note—Parametric Solution of a Class of Nonconvex Programs

This page was built for publication: Bicriteria linear fractional programming