We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d363eaa commit d0bf3d0Copy full SHA for d0bf3d0
README.md
@@ -135,6 +135,18 @@ We can see that the algorithm quickly converges to the optimal point (see Fig. 5
135
For more examples refer to the python scripts in "examples" folder. [https://github.com/tsyet12/Duelist-Algorithm-Python/tree/master/examples]
136
137
138
+# Small Tutorial on Complex Constraint using Karush-Kuhn-Tucker (KKT) conditions
139
+
140
+There will be some problems that have complex constraints. For example, constraints which depends on two or more manipulated variables.
141
142
+Say: we take the same problem from the **Short Tutorial**, and now we have an extra constraint, which is x1 must be larger than x2:
143
+> x1>x2
144
145
+Using KKT conditions, we can put this constraint in the objective function:
146
147
+f=(x1,x2) = (x1)^2+(x2)^2 + (
148
149
150
# Version
151
152
Currently Version 1.0
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments