Displaying similar documents to “Solving a possibilistic linear program through compromise programming.”

Interactive decision-making in multiobjetive fuzzy programming.

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

Mathware and Soft Computing

Similarity:

We present an interactive decision support system which aids in solving a general multiobjective fuzzy problem, that is, a multiobjective programming problem with fuzzy goals subject to a fuzzy constraint set. The interactive decision support system is proposed. After eliciting the fuzzy goals of the decision maker for each objective function and the fuzzy elements for each constraint, the satisfactory solutions for the decision maker were derived by interactively updating the reference...

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...

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.