Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d0bf3d0

Browse files
authored
Update README.md
1 parent d363eaa commit d0bf3d0

File tree

1 file changed

+12
-0
lines changed

1 file changed

+12
-0
lines changed

‎README.md

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -135,6 +135,18 @@ We can see that the algorithm quickly converges to the optimal point (see Fig. 5
135135
For more examples refer to the python scripts in "examples" folder. [https://github.com/tsyet12/Duelist-Algorithm-Python/tree/master/examples]
136136

137137

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+
138150
# Version
139151

140152
Currently Version 1.0

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /