2017
DOI: 10.1007/s10957-017-1088-1
|View full text |Cite
|
Sign up to set email alerts
|

A Reply to a Note on the Paper “A Simplified Novel Technique for Solving Fully Fuzzy Linear Programming Problems”

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…To illustrate the previous algorithm to compute a compromise fuzzy Pareto solution, let us consider the following fully fuzzy multiobjective programming problem, from another used by Khan et al(28;29), also by Arana-Jiménez (5), Table 3 Steps. Outputs from Algorithm 2 (maximization case) z2 , respectively.…”
Section: Numerical Applicationmentioning
confidence: 99%
“…To illustrate the previous algorithm to compute a compromise fuzzy Pareto solution, let us consider the following fully fuzzy multiobjective programming problem, from another used by Khan et al(28;29), also by Arana-Jiménez (5), Table 3 Steps. Outputs from Algorithm 2 (maximization case) z2 , respectively.…”
Section: Numerical Applicationmentioning
confidence: 99%
“…This method was corrected by Najafi and Edalatpanah to make the model well in general, since the original method in Kumar et al can provide infeasible (not nonnegative) optimal solutions. Khan et al deal with FFLP with inequalities, and they also compare the objective function values via ranking functions (see also Bhardwaj and Kumar and Khan et al). Chakraborty et al have updated and applied methods for finding a fuzzy optimal solution to fuzzy transportation problems.…”
Section: Introductionmentioning
confidence: 99%
“…A new method for finding the fuzzy optimal solution of (FFLP) problems with equality constraints, with triangular fuzzy numbers involved, although they use ranking function (see [4], and the references there in) to compare the objective function values. In this way, Khan et al [34] deal with (FFLP) with inequalities, and they also compare the objective function values via ranking functions (see also [8,35]). Das and Göçken [13] apply a ranking method for the reviewer assignment problem.…”
Section: Introductionmentioning
confidence: 99%