Linear optimization: Parametrical objective function 1

Aus Operations-Research-Wiki
Wechseln zu: Navigation, Suche

Parametrical objective function is a component of Operation Research. It belongs to the linear optimization and is a speciall part of the parametrical optimization . With this tool you can determine the limits of the simplex-restrictions as the sensitivity analysis. It can be changed the objective function coefficients. Hereby it can be checked how much one of the objective function coefficients depend on the objective function.


Inhaltsverzeichnis

Explanation

First of all you define one of the objective function coefficients and give them the value q. The value q is in the first iteration zero. Then you determine the pivot element with the normal simplex rules. So you get the first allowable solution.

So that the table is not the optimal solution, the part with the variable q has to be negative. In case of the part with the variable q is negative you can pivot the table for second time.

Now you have new limits for q and you can do one more iteration step and get other limits. The limits are always a lower bound and an upper bound. You end as soon as q has to be larger than the new limit. In addition the limit must be a lower bound for q and q can not be an upper bound.


Example

Sources

-script of the summer semester 2013 at TU Kaiserslautern by Prof. Dr. Oliver Wendt

-Wikipedia link

-Müller-Merbach: Operation Research