The math of effective HP: The concept of effective HP is derived from the way league calculates damage: ( ) ( )

Where P denotes physical damage and M magical damage. This core function states that all incoming raw damage will get cut by a percentage depending on the resistances of the enemy. Since is the true corrected damage, to kill a champion you would need to deal worth of damage, where HP is the health of your enemy, so: ( ) ( )

The effective HP (EHP), is the isolation of the uncorrected raw damages in the above; Divide equation by M+P: ( ) ( )

Multiply then divide under H:

We will give these parameters special names: ( ) ( ) is the percentage of magical damage.

, is the percentage of physical damage, and

)(

Effective HP is therefore dependent on the distribution of damage you are facing. For an extended laning phase we also need to consider the health regeneration effects:

(
The Seals Problem:

)(

We have 9 rune slots for Seals, which gives us 66 different combinations of armor and health seals:

Notice any vertex that does not lie on the line with intercept ( ) will fail to be a maximum, since effective HP is rising in armor and health seals. This is also equivalent to saying we have to fill all 9 slots in Seals:

One of these vertices must be our maximum. The line itself is given as , also we cannot choose negative amounts of runes. We wish to maximize given these constraints, the relevant function is: ( ) (
Together with the maximization problem:

)(

f is differentiable at all inner vertices. Also if a combination ( following conditions are true by the KKT conditions:

) is an optimal solution, then the

(also called Karush-Kuhn-Tucker multipliers) such that these 4 conditions are satisfied:
( )

(
( )

( ( (
( )

) ) )

( )

( ( Where: ( ( ( )

) )

) )

Regularity conditions with regards to the constraints are fulfilled. All of our constraints are affine functions, which is a sufficient condition to secure the maximum found in the KKT is a true maximum. Written out one would need to find a solution to this system:

( ( (

) ) ) (

( ( ( ( (

) ) ) ( ) ) )

( (

) ) ) (

( (

) ) )

( (

) )

First KKT solution:

) Else complementary slackness will fail and primal conditions

will fail. Thus if this solution is optimal we must have: ( ( ) ) |

( ) ( )

|
( ) ( )

From the first equation we get the second KKT multiplier, the third multiplier we get from the second equation: ( ) |
( ) ( )

|
( ) ( )

From the dual constraint we get that ( ( ) |

( ) ( )

) (

) is optimal if and only if: ) |

( ) ( )

The differentials are:

( ( When the above is satisfied ( )( ( ) )) ( ( ) ( ( ) ))

) ] [ ] [ ]

) is optimal. But when is this satisfied? Well: ]

[ [ [ ] ] [

Inserting the quantities we can rewrite the inequality to:

( [ *

) ( (

] ) ) ( ( ( ) ) ( ( ( ) ( )) )) ( ] )+

This is a second degree polynomial inequality in level:

with solution:

Meaning if (
base stats. Second KKT solution:

) is optimal; your level must lie between the roots, spanned by your champions

(
will fail. Thus ( ( ) |
( ) ( )

) Else complementary slackness will fail and primal conditions

|
( ) ( )

From the second equation we get the second KKT multiplier, the third we get from the first equation: ( ) |
( ) ( )

|
( ) ( )

From the dual constraint we get that ( ( ) |

( ) ( )

) (

) is optimal if and only if: ) |

( ) ( )

This is the reverse of the first KKT, giving the negative parameters:

) [ ( *

( ( ( +

)] ( ) ) (( ) ( ) (( ) ) ( ) ) ] ( ) ( ) ( )) )

Will write this as:

Has solution:

The third KKT solution: (

( ( ( ( ( ) ) ) ) )

) (MIX INTRODUCED), thus:

From the first equation we get:

( )
( )

Where

( )

is the optimal choice of

given , insert this into equation 2:

|
(
( ))

( )

Where

( )

is the optimal choice of

given . Inserting these into the equality h gets you:

( ) ( )

The sum: ((

( )

( )

is a second degree polynomial in , and it has two roots; )( ( )( ( ( )) )) (

. ) ( ( ) ) )

((

)( ( )(

( (

)) ))

( (

( )

) )

The roots are complex functions, however given our parameters they will always be rooted in the first root is:
| ( ) ( )( ) ( ) ( ) (

. The solution given

This cannot be our optimum, since optimal solutions:

| | ( [( |

) will break our primal constraints. The second root will give us the

)(

](

These combinations are optimal. However when

then(

, and

. Algebraic manipulations

have tainted the true value of optimum in this particular case, and we need to extract its true limit. Equating with 1, | , you will find that the limit exist in , and is given as: and resolving for | Same problem occurs with | | ( )

| , in this case: ( )

Now we need the primal constraints to be fulfilled, that is:

| ( [( )( ) ( ) ]( ) ( )

[ (

)(

) * ( (( * ( ( )( ( ( ) ) )( ( (

)] ) ) ( (( ( ) ) ( ) )) )+ ) ( ) ) )+

We will write this as:

And the primal for

| ( [( ( ) ( ( | )( ) | ) ( ) ) ]( )

[ (

)(

( (

) [ ( * ( ( )( )( ( ( ( ) ( )

)] ) ( (( ( ) ) ) ) ( (( ) )] ) )) )+ ) )

Which we will call:

Has solution:

For the special case of

the primal conditions simplify:

Thus: