Fuzzy dynamic programming problem for single additive constraint with multiplicatively separable return in terms of trapezoidal membership functions
Dynamic programming problems (DP) are multivariable optimization problems that can be decomposed into a series of stages, and optimization is done at each stage with respect to one variable only. DP allows a suitable quantitative study procedure that can be used to assess various optimization proble...
Gespeichert in:
| Veröffentlicht in: | Wārasān Songkhlā Nakharin Jg. 41; H. 4; S. 761 - 768 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Prince of Songkla University
01.08.2019
|
| Schlagworte: | |
| ISSN: | 0125-3395 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Dynamic programming problems (DP) are multivariable optimization problems that can be decomposed into a series of stages, and optimization is done at each stage with respect to one variable only. DP allows a suitable quantitative study procedure that can be used to assess various optimization problems. The technique offers an efficient procedure for finding optimal decisions. Here, we address a Fuzzy Dynamic Programming Problem with a single additive constraint and multiplicatively separable return, with the support of trapezoidal membership functions and related arithmetic operations. The procedure has been adapted from Fuzzy Dynamic Programming Problem (FDPP). The fuzzified version of the problem is stated and illustrated with a numerical example, and it is shown that the proposed procedure is more efficient in handling the dynamic programming problem than alternative classical procedures. As a final point, the optimal solution is provided in the form of fuzzy numbers with trapezoidal fuzzy membership functions, and also the solution is compared with existing methodology in a numerical example. |
|---|---|
| ISSN: | 0125-3395 |
| DOI: | 10.14456/sjst-psu.2019.97 |