Optimistic Stackelberg solutions to bilevel linear programming with fuzzy random variable coefficients

In this paper, we consider a kind of bilevel linear programming problem where the coefficients of both objective functions are fuzzy random variables. The purpose of this paper is to develop a computational method for obtaining optimistic Stackelberg solutions to such a problem. Based on α-level set...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Knowledge-based systems Jg. 67; S. 206 - 217
Hauptverfasser: Ren, Aihong, Wang, Yuping
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.09.2014
Schlagworte:
ISSN:0950-7051, 1872-7409
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider a kind of bilevel linear programming problem where the coefficients of both objective functions are fuzzy random variables. The purpose of this paper is to develop a computational method for obtaining optimistic Stackelberg solutions to such a problem. Based on α-level sets of fuzzy random variables, we first transform the fuzzy random bilevel programming problem into an α-stochastic interval bilevel linear programming problem. To minimize the interval objective functions, the order relations which represent the decision maker’s preference are defined by the right limit and the center of random interval simultaneously. Using the order relations and expectation optimization, the α-stochastic interval bilevel linear programming problem can be converted into a deterministic multiobjective bilevel linear programming problem. According to optimistic anticipation from the upper level decision maker, the optimistic Stackelberg solution is introduced and a computational method is also presented. Finally, several numerical examples are provided to demonstrate the feasibility of the proposed approach.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2014.05.010