Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
From MaRDI portal
Publication:3757701
Recommendations
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- Solving a special class of multiple objective linear fractional programming problems
- scientific article; zbMATH DE number 4114407
- Determination of the efficient set in multiobjective linear programming
- scientific article; zbMATH DE number 3982936
Cited in
(10)- An approximation to the nondominated set of a multiobjective linear fractional programming problem
- A characterization of weakly efficient points
- A Fourth bibliography of fractional programming
- A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming
- Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- Solving a special class of multiple objective linear fractional programming problems
- Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms
- Multiobjective fractional programming duality theory
- On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010
This page was built for publication: Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757701)