2015
DOI: 10.3846/13926292.2015.1048757
|View full text |Cite
|
Sign up to set email alerts
|

Generating Pareto Optimal Solutions of Multi-Objective LFPP With Interval Coefficients Using E-Constraint Method

Abstract: This paper illustrates a procedure to generate pareto optimal solutions of multi-objective linear fractional programming problem (MOLFPP) with closed interval coefficients of decision variables both in objective and constraint functions.-constraint method is applied to produce pareto optimal solutions comprising most preferred solution to satisfy all objectives. A numerical example is solved using our proposed method and the result so obtained is compared with that of fuzzy programming which justifies the effi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…In general, the objective functions are conflicting, and it is not possible to obtain a unique solution that optimizes simultaneously these objective functions. Many solutions can be found by using the concept of Pareto optimality [7,23]. For this set of solutions, we cannot choose a better one without adding some criteria of preference.…”
Section: Introductionmentioning
confidence: 99%
“…In general, the objective functions are conflicting, and it is not possible to obtain a unique solution that optimizes simultaneously these objective functions. Many solutions can be found by using the concept of Pareto optimality [7,23]. For this set of solutions, we cannot choose a better one without adding some criteria of preference.…”
Section: Introductionmentioning
confidence: 99%