Wiley Encyclopedia of Operations Research and Management Science 2011
DOI: 10.1002/9780470400531.eorms0759
|View full text |Cite
|
Sign up to set email alerts
|

Sensitivity Analysis and Dynamic Programming

Abstract: The validity of any dynamic programming solution depends on the accuracy of the model and the data for a given instance. However, the parameters of the model are often uncertain and estimated in practice. In this paper, we discuss various concepts of sensitivity analysis and survey the work on sensitivity analysis in the dynamic programming literature. In addition, we highlight the relationship between dynamic programming and linear programming and how the approaches and results from the latter can be applied … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 47 publications
0
5
0
Order By: Relevance
“…An important test for evaluating dynamic programming algorithms is the examination of their sensitivity to changes in various parameters of the control process [35][36][37].…”
Section: Computer Simulationmentioning
confidence: 99%
See 1 more Smart Citation
“…An important test for evaluating dynamic programming algorithms is the examination of their sensitivity to changes in various parameters of the control process [35][36][37].…”
Section: Computer Simulationmentioning
confidence: 99%
“…Figure 9a shows the safe and optimal trajectory of object 0 in conditions of good visibility, and Figure 9b in conditions of limited visibility. An important test for evaluating dynamic programming algorithms is the examination of their sensitivity to changes in various parameters of the control process [35][36][37]. The measure of sensitivity s was the relative change in the optimal time t opt of the safe and optimal trajectory of object 0 caused by a change in the selected parameter of the control process p:…”
Section: Computer Simulationmentioning
confidence: 99%
“…Suppose that in group Agentsi the proportion of agents which uses Low-carbon strategy is x, then the proportion uses strategy is 1 − ; in group Agentsj the proportion of agents which uses Low-carbon strategy is y, then the proportion uses strategy is 1 − ; , respectively stand for agent i and j's profit when using strategy ; , respectively stand for agent i and j's cooperation cost when using strategy ; , respectively stand for agent i and j 's speculativerevenue when using strategy , while the other side's strategy choice is ;ℎ , ℎ respectively stand for agent i and j 's coefficient of profitability; , respectively stand for agent i and j 's coefficient of cooperative profitability. All the parameters in the game payoff matrix are positive number [2]. (2) The two equations describe the evolution of traditional industrial clusters.…”
Section: A Low-carbon Evolutionarymodel Of Chinesetraditional Industr...mentioning
confidence: 99%
“…307-314]. In theory, MDPs can be formulated as linear programs [11] and the allowable ρ values can be obtained by applying results from parametric linear programming (see [5] and [23]) on the dual of the associated linear program (see [19]). However, the set of necessary and sufficient conditions (i.e.…”
Section: Stationary Rewardsmentioning
confidence: 99%