𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving fuzzy inequalities with concave membership functions

✍ Scribed by Cheng-Feng Hu; Shu-Cherng Fang

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
373 KB
Volume
99
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

✦ Synopsis

Solving systems of fuzzy inequalities could lead to the solutions of fuzzy mathematical programs. It is shown that a system of fuzzy inequalities with concave membership functions can be converted to a regular convex programming problem. A "method of centres" with "entropic regularization" techniques is proposed for solving such a problem. Some computational results are included.

πŸ“œ SIMILAR VOLUMES

Solving a system of infinitely many fuzz
Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
✍ Cheng-Feng Hu; Shu-Cherng Fang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 717 KB

A cutting plane type algorithm for solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions is proposed. In each iteration, we solve a finite nonlinear optimization problem and add one or two more constraints. The iterative process ends when an optimal soluti

A fuzzy multiobjective program with quas
A fuzzy multiobjective program with quasiconcave membership functions and fuzzy coefficients
✍ Han-Lin Li; Chian-Son Yu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 274 KB

A method is proposed for solving a fuzzy multi-objective linear programming problem (FMP) with quasiconcave membership functions and fuzzy coe cients. The proposed method ΓΏrst expresses a piecewise function as the summation of absolute terms. Then we search for the interval where the optimal solutio

Fuzzy programming technique to solve mul
Fuzzy programming technique to solve multi-objective transportation problems with some non-linear membership functions
✍ Rakesh Verma; M.P. Biswal; A. Biswas πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 379 KB

The Multi-objective transportation problem refers to a special class of vector-minimum linear programming problems in which the constraints are of equality type and all the objectives are non-commensurable and conflict with each other. All the methods either generate a set of non-dominated solutions