A method for solving a problem of possibilistic programming |
| |
| Authors: | R. N. Gordeev A. V. Yazenin |
| |
| Affiliation: | (1) Tver State University, ul. Zhelyabova 3, Tver, 170000, Russia |
| |
| Abstract: | The models of possibilistic programming considered in [1–3] are generalized to the case when the binary relations that relate the left and right sides in the model of constraints are fuzzy. The corresponding mathematical formalism for describing models of this class is developed. A method for solving the problem is proposed. The capabilities of the approach are demonstrated in numerical examples. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
