Skip to content
naulon
Not checkedNot checked for notices yet.

Fuzzy dynamic programming problem for single additive constraint with multiplicatively separable return in terms of trapezoidal membership functions

Kaliyaperumal Palanivel, Prakasam Muralikrishna

Songklanakarin Journal of Science and Technology (SJST) · 2019

doi:10.14456/sjst-psu.2019.97 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

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.

Abstract licence: CC BY-NC

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.