Nonlinear Opt.: KKT- theorem 5

Aus Operations-Research-Wiki
Version vom 29. Juni 2013, 22:06 Uhr von Tatuebu (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „= '''Karush-Kuhn Tucker Theorie (KKT-Theorie) :''' = <nowiki>Karush-Kuhn Tucker Theorem (KKT-Theorem) is a mathematical Method to solve Nonlinear optimizati…“)

(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)

Wechseln zu: Navigation, Suche

Karush-Kuhn Tucker Theorie (KKT-Theorie) :

Karush-Kuhn Tucker Theorem (KKT-Theorem) is a mathematical Method to solve Nonlinear optimization problems with help of Lagrangian Function. It requires inequality constraints. The system of equations corresponding to the KKT conditions is usually not solved directly, except in the few special cases where a closed-form solution can be derived analytically.

Optimality conditions according to KKT-Theorem:

#Generalization of the Lagrangian condition #Take the inequality Constraints in consideration #Necessary (even sufficient under certain preconditions) conditions which shall be satisfied by an extremizer of the Lagrangian function.

Nonlinear minimization problem

Consider the nonlinear optimization Problem :

Min = (, …., )

s.t. (, ..., ) – b ≤0 bzw. (,. ..,) ≤ 0 , ≥ 0

 ; .

f and g are continuously differentiable

Lagrangian Function for a optimization Problem who has to be minimized:

= (,…,)+ Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): \sum_{k=1}^m\lambda_i

  (,…,)

Or

A vector Fehler beim Parsen (http://mathoid.testme.wmflabs.org Serverantwort ist ungültiges JSON.): (x ̂, \lambda ̂) in is called saddle point of Lagrangian function , if it holds for all x ∈ And :