Header menu link for other important links
Fuzzy Dynamic Programming Problem for Single Additive Constraint with Additively Separable Return by Means of Trapezoidal Membership Functions
Published in IGI Global
Volume: 41
Issue: 4
Pages: 168 - 187
Dynamic Programming Problem (DPP) is a multivariable optimization problem is decomposed into a series of stages, optimization being done at each stage with respect to one variable only. DP stands a suitable quantitative study procedure that can be used to explain various optimization problems. It deals through reasonably large as well as complex problems; in addition, it involves creating a sequence of interconnected decisions. The technique offers an efficient procedure for defining optimal arrangement of decisions. Throughout this chapter, solving procedure completely deliberate about as Fuzzy Dynamic Programming Problem for single additive constraint with additively separable return with the support of trapezoidal membership functions and its arithmetic operations. Solving procedure has been applied from the approach of Fuzzy Dynamic Programming Problem (FDPP). The fuzzified version of the problem has been stated with the support of a numerical example for both linear and nonlinear fuzzy optimal solutions and it is associated to showing that the proposed procedure offers an efficient tool for handling the dynamic programming problem instead of classical procedures. As a final point the optimal solution with in the form of fuzzy numbers and justified its solution with in the description of trapezoidal fuzzy membership functions.
About the journal
JournalHandbook of Research on Fuzzy and Rough Set Theory in Organizational Decision Making Advances in Business Strategy and Competitive Advantage
PublisherIGI Global
Open Access0