Extension of Duality Results and a Dual Simplex Method for Linear Programming Problems With Intuitionistic Fuzzy Variables

The aim of this paper is to introduce a formulation of linear programming problems involving intuitionistic fuzzy variables. Here, we will focus on duality and a simplex-based algorithm for these problems. We classify these problems into two main different categories: linear programming with intuiti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Fuzzy information and engineering Jg. 12; H. 3; S. 392 - 411
Hauptverfasser: Goli, M., Nasseri, S. H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis 02.07.2020
Taylor & Francis Group
Schlagworte:
ISSN:1616-8658, 1616-8666
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The aim of this paper is to introduce a formulation of linear programming problems involving intuitionistic fuzzy variables. Here, we will focus on duality and a simplex-based algorithm for these problems. We classify these problems into two main different categories: linear programming with intuitionistic fuzzy numbers problems and linear programming with intuitionistic fuzzy variables problems. The linear programming with intuitionistic fuzzy numbers problem had been solved in the previous literature, based on this fact we offer a procedure for solving the linear programming with intuitionistic fuzzy variables problems. In methods based on the simplex algorithm, it is not easy to obtain a primal basic feasible solution to the minimization linear programming with intuitionistic fuzzy variables problem with equality constraints and nonnegative variables. Therefore, we propose a dual simplex algorithm to solve these problems. Some fundamental concepts and theoretical results such as basic solution, optimality condition and etc., for linear programming with intuitionistic fuzzy variables problems, are established so far. Moreover, the weak and strong duality theorems for linear programming with intuitionistic fuzzy variables problems are proved. In the end, the computational procedure of the suggested approach is shown by numerical examples.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1616-8658
1616-8666
DOI:10.1080/16168658.2021.1908818