L.

O7
 Completing the Square
"Completing the Square" is where we ...

... take a Quadratic Equation like this: and turn it into this:

ax2 + bx + c = 0 a(x+d)2 + e = 0
For those of you in a hurry, I can tell you that:
L.O.8
L.O.9 ,10
 1  cos 2 x 1  cos 2 x
sin 2 x  and cos2 x 
2 2
L.O.11 and L.O.12
Linear programming (LP; also called linear optimization)
is a method to achieve the best outcome (such as
maximum profit or lowest cost) in a mathematical
model whose requirements are represented by linear
relationships. Linear programming is a special case of
mathematical programming (mathematical optimization
In mathematical optimization, a feasible region,feasible set, search space, or solution space is the set of all
possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's
constraints, potentially including inequalities, equalities, and integer constraints

An optimal solution is a feasible solution where the objective function reaches its maximum (or minimum)
value – for example, the most profit or the least cost. A globally optimal solution is one where there are no
other feasible solutions with better objective function values