Sensitivity analysis in discrete dynamic programming (Q1090253)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sensitivity analysis in discrete dynamic programming
scientific article

    Statements

    Sensitivity analysis in discrete dynamic programming (English)
    0 references
    1988
    0 references
    The problem of characterizing the minimum perturbations to parameters in future stages of a discrete dynamic program necessary to change the optimal first policy is considered. Lower bounds on these perturbations are derived and used to establish ranges for the reward functions over which the optimal first policy is robust. A numerical example is presented to illustrate factors affecting the tightness of these bounds.
    0 references
    minimum perturbations
    0 references
    discrete dynamic program
    0 references
    sensitivity analysis
    0 references
    0 references

    Identifiers