Decision Method For Confinement Index Of A Class Of Dynamic Programming

When application of Dynamic Programming theory to solve multistage decision process,often in the presence of one or more confinement indices restricting selection of state variable.Soneed to consider how to selece state variables under the condition of existence confinementindeces,achieve optimization of objective function.This paper studies problem of dynamic programming belt confinement indices.Based onAHP and dynamic programming model, introduce entropy weight theory,solving objectiveweight of confinement indices,and according to confining ability of different time,conductweighted processing.Last,comprehensive state variables to weights of confinement indices, theoriginal static confinement indices translate into the dynamical variable of influence the outcomeof a decision, solution decision-making optimization problem under the influence of differentconfinement indices.According to the specific circumstances, this algorithm making rational judgment to theconfining ability of confinement indices, avoid the problem of model constraint indices staticthinking, more beneficial for making dynamic adjustment,has great flexibility, to respond todifferent state of emergency.