A Solution Concept for Fuzzy Multiobjective Programming Problems Based on Convex Cones |
| |
Authors: | H. C. Wu |
| |
Affiliation: | (1) Department of Information Management, National Chi Nan University, Puli, Nantou, Taiwan |
| |
Abstract: | A solution concept for fuzzy multiobjective programming problems based on ordering cones (convex cones) is proposed in this paper. The notions of ordering cones and partial orderings on a vector space are essentially equivalent. Therefore, the optimality notions in a real vector space can be elicited naturally by invoking a concept similar to that of the Pareto-optimal solution in vector optimization problems. We introduce a corresponding multiobjective programming problem and a weighting problem of the original fuzzy multiobjective programming problem using linear functionals so that the optimal solution of its corresponding weighting problem is also the Pareto-optimal solution of the original fuzzy multiobjective programming problem. |
| |
Keywords: | Fuzzy numbers ordering cones strong weak minimal elements complete optimal solutions Pareto-optimal solutions (weak) |
本文献已被 SpringerLink 等数据库收录! |