Linear optimization: Sensibility analysis 1: Unterschied zwischen den Versionen
Aus Operations-Research-Wiki
| [unmarkierte Version] | [unmarkierte Version] |
(→Theory) |
(→Theory) |
||
| Zeile 3: | Zeile 3: | ||
== Theory == | == Theory == | ||
| − | The term | + | The term "sensibilitätsanalyse" was derived from the original english term sensitivity analysis by Müller-Merbach [Operations Research] in 1992. Sensibility analysis is the retranslation of that. These two terms are being used equally. |
After having found an optimal solution for a linear optimization problem by the means of the Simplex algorithm, one can use the sensibility analysis to see, how much the initial solution can change, without changing the structure of the optimal solution. | After having found an optimal solution for a linear optimization problem by the means of the Simplex algorithm, one can use the sensibility analysis to see, how much the initial solution can change, without changing the structure of the optimal solution. | ||
| Zeile 9: | Zeile 9: | ||
<!--In particular, you can see --> | <!--In particular, you can see --> | ||
| + | |||
| + | === Non basic variables === | ||
== Example == | == Example == | ||
Version vom 27. Juni 2013, 17:01 Uhr
Besetzt H&S
Inhaltsverzeichnis
Theory
The term "sensibilitätsanalyse" was derived from the original english term sensitivity analysis by Müller-Merbach [Operations Research] in 1992. Sensibility analysis is the retranslation of that. These two terms are being used equally.
After having found an optimal solution for a linear optimization problem by the means of the Simplex algorithm, one can use the sensibility analysis to see, how much the initial solution can change, without changing the structure of the optimal solution. In other words you can see, the robustness of your optimal programm regarding the change of the objective function or constraints.
