Nonlinear Opt.: Basic concepts 3: Unterschied zwischen den Versionen

Aus Operations-Research-Wiki
Wechseln zu: Navigation, Suche
[unmarkierte Version][unmarkierte Version]
Zeile 1: Zeile 1:
 
 
Theory
 
Theory
 
----
 
----
Zeile 5: Zeile 4:
 
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
+
The gereral form of a non linear optimization can be stated as:
----
+
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>
 
<math>max~z= f(x_{1},...,x_{n})</math>
 +
  
 
under the constraints that:
 
under the constraints that:
 +
  
 
<math>h_{i}(x_{1},...,x_{n})\leq b_{i}\qquad i=1,...,m</math>
 
<math>h_{i}(x_{1},...,x_{n})\leq b_{i}\qquad i=1,...,m</math>
 +
  
 
and:
 
and:
 +
  
 
<math>x_{j}\geq 0\qquad j=1,...,n</math>
 
<math>x_{j}\geq 0\qquad j=1,...,n</math>
  
Durch Umformen der Restriktion
+
 
 +
By transforming the restriction
 +
 
  
 
<math>h_{i}(x_{1},...,x_{n})\leq b_{i}</math>
 
<math>h_{i}(x_{1},...,x_{n})\leq b_{i}</math>
 +
  
 
in
 
in
 +
  
 
<math>h_{i}(x_{1},...,x_{n})-b_{i}\leq 0</math>
 
<math>h_{i}(x_{1},...,x_{n})-b_{i}\leq 0</math>
  
und der Benennung dieser Ungleichung mit <math>g_{i}</math>
+
 
 +
and nominating this inequality with <math>g_{i}</math>
 +
 
  
 
<math>max~z=f(x_{1},...,x_{n})</math>
 
<math>max~z=f(x_{1},...,x_{n})</math>
  
unter der Berücksichtigung der Nebenbedingungen:
+
 
 +
in consideration of the restrictions:
 +
 
  
 
<math>g_{i}(x_{1},...,x_{n})\leq 0\qquad i=1,...,m</math>
 
<math>g_{i}(x_{1},...,x_{n})\leq 0\qquad i=1,...,m</math>
Zeile 66: Zeile 73:
  
  
<math>\frac{\partial^2 }{\partial x^2}f(x)=4>0 \rightarrow max</math> 
+
<math>\frac{\partial^2 }{\partial x^2}f(x)=4>0 \rightarrow max</math>
 
+
 
+
 
+
'''Example 3 ( Hessian Matrix)'''
+
 
+
 
+
<math>f(x_1,x_2)= 88x_1-x1^2+88x_2-x_2^2</math>
+
 
+
<math>\begin{pmatrix}
+
88-2x^1\\ 88-2x^2
+
 
+
 
+
\end{pmatrix} \rightarrow      Hessian Matrix H(x)=      \begin{pmatrix}
+
-2  & 0 \\ 0
+
& -2
+
\end{pmatrix}  </math>
+
 
+
<math>\nabla F(x_1) = 88-2x_1\rightarrow x_1=44</math>
+
 
+
 
+
<math>\nabla F(x_2)=88-2x_2\rightarrow x_2=44</math>
+

Version vom 30. Juni 2013, 16:36 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.

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


By transforming the restriction


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): h_{i}(x_{1},...,x_{n})\leq b_{i}


in


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): h_{i}(x_{1},...,x_{n})-b_{i}\leq 0


and nominating this inequality with



in consideration of the restrictions:


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): g_{i}(x_{1},...,x_{n})\leq 0\qquad i=1,...,m



Example



Example 1 (Maximization)


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): f(x)=5x-2x^2


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): \frac{\partial }{\partial x} f(x)=5-4x


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): \frac{\partial^2 }{\partial x^2}f(x)=4>0 \rightarrow min


Example 1 (Minimization)



Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): \frac{\partial }{\partial x}f(x)=5+4x


Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): \frac{\partial^2 }{\partial x^2}f(x)=4>0 \rightarrow max