Linear optimization: Mathematical formulations of problems presented in the course 2: Unterschied zwischen den Versionen
Aus Operations-Research-Wiki
| [unmarkierte Version] | [unmarkierte Version] |
(→Introduction) |
(→Standart Form) |
||
| Zeile 4: | Zeile 4: | ||
==Standart Form== | ==Standart Form== | ||
| + | The standard form consists of three parts which can be described as: | ||
| + | • Goal function (to maximize/minimize): | ||
| + | |||
| + | <math>f(x_{1},x_{2})=c_{1}x{_{1}}+c_{2}x_{2}</math> | ||
| + | |||
| + | • Restrictions: | ||
| + | |||
| + | |||
| + | • Non-negative variables: | ||
| + | |||
| + | |||
| + | The problem can be solved in two ways: | ||
| + | 1) Graphically, when the function is dependend on 2 variables | ||
| + | 2) With Simplex- Algorithm, when the function is dependend on multiple variables | ||
| + | |||
==Example of Linear Optimization== | ==Example of Linear Optimization== | ||
==Example of simplex algorithmus== | ==Example of simplex algorithmus== | ||
Version vom 26. Juni 2013, 17:53 Uhr
Inhaltsverzeichnis
Introduction
Linear optimization deals with the optimization of linear goal functions considering certain restrictions. One can either maximize or minimize a goal function.
Standart Form
The standard form consists of three parts which can be described as: • Goal function (to maximize/minimize):
• Restrictions:
• Non-negative variables:
The problem can be solved in two ways:
1) Graphically, when the function is dependend on 2 variables
2) With Simplex- Algorithm, when the function is dependend on multiple variables
