Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  fuzzy goal programming
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
This paper proposes a generalized domain optimization method for fuzzy goal programming with different priorities. According to the three possible styles of the objective function, the domain optimization method and its generalization are correspondingly proposed. This method can generate the results consistent with the decision-maker's priority expectations, according to which the goal with higher priority may have higher level of satisfaction. However, the reformulated optimization problem may be nonconvex for the reason of the nature of the original problem and the introduction of the varying-domain optimization method. It is possible to obtain a local optimal solution for nonconvex programming by the SQP algorithm. In order to get the global solution of the new programming problem, the co-evolutionary genetic algorithm, called GENOCOP III, is used instead of the SQP method. In this way the decision-maker can get. the optimum of the optimization problem. We demonstrate the power of this proposed method based on genetic algorithm by illustrative examples.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.