Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming

DOI10.1287/MNSC.31.2.240zbMath0619.90074OpenAlexW1989472904MaRDI QIDQ3757701

Harold P. Benson

Publication date: 1985

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.31.2.240

zbMATH Keywords

break pointsmultiple objective linear fractional programmingaugmented feasible regionfail-safe methodweakly-efficient vertices

Mathematics Subject Classification ID

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

Related Items (9)

Multiobjective fractional programming duality theory ⋮ SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS ⋮ A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming ⋮ A Fourth bibliography of fractional programming ⋮ Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions ⋮ On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010 ⋮ A characterization of weakly efficient points ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms

This page was built for publication: Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming