Nonlinear Opt.: Basic concepts 3: Unterschied zwischen den Versionen
| [unmarkierte Version] | [unmarkierte Version] |
Leffer (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „ Theory ---- In contrast to the Linear Optimization, which solution method is the simplex algorithm, there is no comparable solution method für Nonlinear Opti…“) |
Langc (Diskussion | Beiträge) |
||
| Zeile 4: | Zeile 4: | ||
In contrast to the Linear Optimization, which solution method is the simplex algorithm, there is no comparable solution method für Nonlinear Optimization problems. | In contrast to the Linear Optimization, which solution method is the simplex algorithm, there is no comparable solution method für Nonlinear Optimization problems. | ||
Instead of the Simplex algorithm there are different solution methods which are specific for a given problem. But there is no gurantee for an optimal solution. | Instead of the Simplex algorithm there are different solution methods which are specific for a given problem. But there is no gurantee for an optimal solution. | ||
| + | |||
| + | Theory | ||
| + | ---- | ||
| + | In contrast to the Linear Optimization, which solution method is the simplex algorithm, there is no comparable solution method für Nonlinear Optimization problems. | ||
| + | Instead of the Simplex algorithm there are different solution methods which are specific for a given problem. But there is no gurantee for an optimal solution. | ||
| + | |||
| + | The gereral form of a non linear optimization can be stated as: | ||
| + | |||
| + | <math>max~z= f(x_{1},...,x_{n})</math> | ||
| + | |||
| + | under the constraints that: | ||
| + | |||
| + | <math>h_{i}(x_{1},...,x_{n})\leq b_{i}\qquad i=1,...,m</math> | ||
| + | |||
| + | and: | ||
| + | <math>x_{j}\geq 0\qquad j=1,...,n</math> | ||
| + | |||
| + | <math>h_{i}(x_{1},...,x_{n})\leq b_{i}</math> | ||
| + | |||
| + | <math>h_{i}(x_{1},...,x_{n})-b_{i}\leq 0</math> | ||
| + | |||
| + | <math>maxZ=f(x_{1},...,x_{n})</math> | ||
Version vom 28. Juni 2013, 11:47 Uhr
Theory
In contrast to the Linear Optimization, which solution method is the simplex algorithm, there is no comparable solution method für Nonlinear Optimization problems. Instead of the Simplex algorithm there are different solution methods which are specific for a given problem. But there is no gurantee for an optimal solution.
Theory
In contrast to the Linear Optimization, which solution method is the simplex algorithm, there is no comparable solution method für Nonlinear Optimization problems. Instead of the Simplex algorithm there are different solution methods which are specific for a given problem. But there is no gurantee for an optimal solution.
The gereral form of a non linear optimization can be stated as:
under the constraints that:
Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): h_{i}(x_{1},...,x_{n})\leq b_{i}\qquad i=1,...,m
and:
Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): x_{j}\geq 0\qquad j=1,...,n
Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): h_{i}(x_{1},...,x_{n})\leq b_{i}
Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): h_{i}(x_{1},...,x_{n})-b_{i}\leq 0
