The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A generalized varying-domain optimization method for fuzzy goal programming with priorities based on a genetic algorithm”

Fuzzy linear programming via simulated annealing

Rita Almeida Ribeiro, Fernando Moura Pires (1999)

Kybernetika

Similarity:

This paper shows how the simulated annealing (SA) algorithm provides a simple tool for solving fuzzy optimization problems. Often, the issue is not so much how to fuzzify or remove the conceptual imprecision, but which tools enable simple solutions for these intrinsically uncertain problems. A well-known linear programming example is used to discuss the suitability of the SA algorithm for solving fuzzy optimization problems.

Linear optimization with bipolar max-parametric hamacher fuzzy relation equation constraints

Samaneh Aliannezhadi, Ali Abbasi Molai, Behnaz Hedayatfar (2016)

Kybernetika

Similarity:

In this paper, the linear programming problem subject to the Bipolar Fuzzy Relation Equation (BFRE) constraints with the max-parametric hamacher composition operators is studied. The structure of its feasible domain is investigated and its feasible solution set determined. Some necessary and sufficient conditions are presented for its solution existence. Then the problem is converted to an equivalent programming problem. Some rules are proposed to reduce the dimensions of problem. Under...

Solving a possibilistic linear program through compromise programming.

Mariano Jiménez López, María Victoria Rodríguez Uría, María del Mar Arenas Parra, Amelia Bilbao Terol (2000)

Mathware and Soft Computing

Similarity:

In this paper we propose a method to solve a linear programming problem involving fuzzy parameters whose possibility distributions are given by fuzzy numbers. To address the above problem we have used a preference relationship of fuzzy numbers that leads us to a solving method that produces the so-called α-degree feasible solutions. It must be pointed out that the final solution of the problem depends critically on this degree of feasibility, which is in conflict with the optimal value...

A dual approach in fuzzy linear programming.

José M. Cadenas, Fernando Jiménez (1996)

Mathware and Soft Computing

Similarity:

In this paper, we propose a relationship of fuzzy duality. We use the Decomposition Theorem and some properties about Linear Programming with interval coefficients to define this relationship. Thus, a linear programming problem with fuzzy costs represented by membership functions L-R can be solved by means of two dual problems (linear programming problems with fuzzy constraints). Moreover, these results can be applied to multiobjective problems whose coefficients of the objective function...