Interactive fuzzy random two-level linear programming through fractile criterion optimization

In this paper, assuming cooperative behavior of the decision makers, solution methods for decision making problems in hierarchical organizations under fuzzy random environments are considered. To deal with the formulated two-level linear programming problems involving fuzzy random variables, α -leve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical and computer modelling Jg. 54; H. 11; S. 3153 - 3163
Hauptverfasser: Sakawa, Masatoshi, Katagiri, Hideki, Matsui, Takeshi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kidlington Elsevier Ltd 01.12.2011
Elsevier
Schlagworte:
ISSN:0895-7177, 1872-9479
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, assuming cooperative behavior of the decision makers, solution methods for decision making problems in hierarchical organizations under fuzzy random environments are considered. To deal with the formulated two-level linear programming problems involving fuzzy random variables, α -level sets of fuzzy random variables are introduced and an α -stochastic two-level linear programming problem is defined for guaranteeing the degree of realization of the problem. Taking into account the vagueness of judgments of decision makers, fuzzy goals are introduced and the α -stochastic two-level linear programming problem is transformed into the problem to maximize the satisfaction degree for each fuzzy goal. Through the use of the fractile criterion optimization model, the transformed stochastic two-level programming problem can be reduced to a deterministic one. Interactive fuzzy programming to obtain a satisfactory solution for the decision maker at the upper level in consideration of the cooperative relation between decision makers is presented. It is shown that all of the problems to be solved in the proposed interactive fuzzy programming can be easily solved by the simplex method, the sequential quadratic programming or the combined use of the bisection method and the sequential quadratic programming. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0895-7177
1872-9479
DOI:10.1016/j.mcm.2011.08.006