Деякi детермінованi моделi задач нечіткого лінійного програмування
We consider deterministic equivalents of various formulations of linear programming prob-lems, in which the coefficients of the objective function, constraints and the boundary values of the variables of the problem and the right-hand side are represented by fuzzy sets. The methods for comparing the...
Збережено в:
| Видавець: | The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" |
|---|---|
| Дата: | 2016 |
| Автор: | |
| Формат: | Стаття |
| Мова: | rus |
| Опубліковано: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2016
|
| Онлайн доступ: | http://journal.iasa.kpi.ua/article/view/65806 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Репозиторії
System research and information technologies| Резюме: | We consider deterministic equivalents of various formulations of linear programming prob-lems, in which the coefficients of the objective function, constraints and the boundary values of the variables of the problem and the right-hand side are represented by fuzzy sets. The methods for comparing the fuzzy sets and selecting the best ones are proposed. The problem of finding the vec-tor of variables as a vector of real numbers is reduced to solving the one-criterion or multicriteria problem with the significantly large number of constraints. In solving the problem as a vector of Fuzzy-sets, the equivalent problem was determined – a sequence of linear programming problems. The formulated problems can be solved by the simplex method. |
|---|