An effective computational attempt for solving fully fuzzy linear programming using MOLP problem

This paper is concerned with the solution procedure of a fully fuzzy linear programming (FFLP) problem in which all parameters are represented in terms of triangular fuzzy numbers. According to the existing solution approach and based a new lexicographic ordering on triangular fuzzy numbers, the FFL...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of industrial and production engineering Jg. 36; H. 2; S. 59 - 69
1. Verfasser: Ebrahimnejad, Ali
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis 17.02.2019
Taylor & Francis Ltd
Schlagworte:
Algorithms
Computation
computational complexity
Fully fuzzy linear programming
lexicographic ordering on triangular fuzzy numbers
Linear programming
Mathematical programming
multi-objective linear programming problem
Multiple objective analysis
Pareto optimum
ISSN:2168-1015, 2168-1023
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper is concerned with the solution procedure of a fully fuzzy linear programming (FFLP) problem in which all parameters are represented in terms of triangular fuzzy numbers. According to the existing solution approach and based a new lexicographic ordering on triangular fuzzy numbers, the FFLP problem under consideration is converted into a multi-objective linear programming (MOLP) problem with three-objective functions. This paper provides a new technique for reducing the computational complexity of some current FFLP problems for situations that all imprecise data are represented as nonnegative triangular fuzzy numbers. Finally, using a simple example and one case study the results obtained using the proposed algorithm and those obtained using with the existing methods are compared, demonstrating the reliability and applicability of our algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2168-1015
2168-1023
DOI:10.1080/21681015.2019.1585391