A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
From MaRDI portal
Publication:1584795
DOI10.1016/S0377-2217(99)00298-2zbMath0970.90104MaRDI QIDQ1584795
Dessilava Gueorguieva, Boyan S. Metev
Publication date: 11 January 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Fractional programming (90C32) Linear programming (90C05)
Related Items (19)
A reference point technique to compute nondominated solutions in MOLFP ⋮ Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique ⋮ Acceptable optimality in linear fractional programming with fuzzy coefficients ⋮ A novel methodology for portfolio selection in fuzzy multi criteria environment using risk-benefit analysis and fractional stochastic ⋮ A linear programming approach to test efficiency in multi-objective linear fractional programming problems ⋮ Multiobjective integer nonlinear fractional programming problem: a cutting plane approach ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Enhancing computations of nondominated solutions in MOLFP via reference points ⋮ Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis ⋮ An exact method for a discrete multiobjective linear fractional optimization ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ An improved method for solving multiobjective integer linear fractional programming problem ⋮ Optimization of functions with rank-two variation over a box ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ Unnamed Item ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ A new methodology for solving bi-criterion fractional stochastic programming ⋮ A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points ⋮ A sixth bibliography of fractional programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete algorithm for linear fractional programs
- A compromise procedure for the multiple objective linear fractional programming problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Use of reference points for solving MONLP problems
- Organizations: multiple agents with multiple criteria. Proceedings of the Fourth International Conference on Multiple Criteria Decision Making, University of Delaware, Newark, August 10-15, 1980
- A restricted class of multiobjective linear fractional programming problems
- A Parametric Method for Solving the Linear Fractional Programming Problem
- On Martos' and Chaehes-Coopeb's approach vis-a-vis
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- Equivalence of various linearization algorithms for linear fractional programming
- Programming with linear fractional functionals
This page was built for publication: A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
