Interactive multiobjective fuzzy random programming through the level set-based probability model

This paper considers a multiobjective linear programming problem involving fuzzy random variable coefficients. A new fuzzy random programming model is proposed by extending the ideas of level set-based optimality and a stochastic programming model. The original problem involving fuzzy random variabl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information sciences Jg. 181; H. 9; S. 1641 - 1650
Hauptverfasser: Katagiri, Hideki, Sakawa, Masatoshi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.05.2011
Schlagworte:
Algorithms
Fuzzy
Fuzzy logic
Fuzzy random variable
Fuzzy set theory
Interactive
Interactive algorithm
Level set-based model
Mathematical models
Multiobjective linear programming
Optimization
Pareto optimality
Probability maximization
Programming
Pareto optimality
Level set-based model
Fuzzy random variable
Multiobjective linear programming
Probability maximization
Interactive algorithm
ISSN:0020-0255, 1872-6291
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper considers a multiobjective linear programming problem involving fuzzy random variable coefficients. A new fuzzy random programming model is proposed by extending the ideas of level set-based optimality and a stochastic programming model. The original problem involving fuzzy random variables is transformed into a deterministic equivalent problem through the proposed model. An interactive algorithm is provided to obtain a satisficing solution for a decision maker from among a set of newly defined Pareto optimal solutions. It is shown that an optimal solution of the problem to be solved iteratively in the interactive algorithm is analytically obtained by a combination of the bisection method and the simplex method.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2011.01.003