𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving nonlinear optimization problems with fuzzy relation equation constraints

✍ Scribed by Jianjun Lu; Shu-Cherng Fang

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
176 KB
Volume
119
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

✦ Synopsis

An optimization model with a nonlinear objective function subject to a system of fuzzy relation equations is presented. Since the solution set of the fuzzy relation equations is in general a non-convex set, when it is not empty, conventional nonlinear programming methods are not ideal for solving such a problem. In this paper, a genetic algorithm (GA) is proposed. This GA is designed to be domain speciΓΏc by taking advantage of the structure of the solution set of fuzzy relation equations. The individuals from the initial population are chosen from the feasible solution set and are kept within the feasible region during the mutation and crossover operations. The construction of test problems is also developed to evaluate the performance of the proposed algorithm.

πŸ“œ SIMILAR VOLUMES

Two new algorithms for solving optimizat
Two new algorithms for solving optimization problems with one linear objective function and finitely many constraints of fuzzy relation inequalities
✍ Ali Abbasi Molai πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 877 KB

This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio