A Computationally Efficient Algorithm to Approximate the Pareto Front of Multi-Objective Linear Fractional Programming Problem

RAIRO - Operations Research- France

doi 10.1051/ro/2018083

Full Text

Abstract

Available in

Date

Authors

Publisher

EDP Sciences

Related search

Pareto Optimal Solution Analysis of Convex Multi-Objective Programming Problem

Journal of Networks
2013English

An L1-Norm Method for Generating All of Efficient Solutions of Multi-Objective Integer Linear Programming Problem

Journal of Industrial Engineering International
IndustrialManufacturing Engineering
2012English

Approximate Pareto Sets of Minimal Size for Multi-Objective Optimization Problems

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2015English

Representation of the Pareto Front for Heterogeneous Multi-Objective Optimization

Journal of Applied and Numerical Optimization
2019English

Determining Efficient Solutions to Multiple Objective Linear Programming Problems

Applied Mathematical Sciences
2013English

Goal Programming Approach for Solving Multi-Objective Fractional Transportation Problem With Fuzzy Parameters

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2019English

Algorithm for Solving Fuzzy Multiobjective Linear Fractional Programming Problem by Additive Weighted Method

International Journal of Computer Applications
2013English

Solving Large-Scale Three-Level Linear Fractional Programming Problem With Rough Coefficient in Objective Function

International Journal of Computer Applications
2017English

Using Harmonic Mean to Solve Multi-Objective Linear Programming Problems

American Journal of Operations Research
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy