Every tool in this chapter answers one of three questions about a point. Is it flat? Critical points and the gradient answer that. If it's flat, is it a bottom, a top, or a saddle? The second derivative test answers that, and the eigenvalues of the Hessian carry the same test into any number of variables. If the point has to obey a rule, Lagrange's condition handles an equation, and the corner-point theorem handles straight-line inequalities. The notation, meaning limits, big-O, sums, x^{(k)} and design points, is how the rest of the course will describe a search that improves a guess one step at a time.
You can now find and sort a candidate point by hand. Take f(x,y)=x^2+2y^2-4x. Setting f_x=2x-4 and f_y=4y to zero gives (2,0). There D=2\cdot4-0=8>0 and f_{xx}=2>0, so it's a minimum, with f(2,0)=-4. The Hessian's eigenvalues, 2 and 4, are both positive, which says the same thing: a bowl. Next, Chapter 1 gives exact names to what is being chosen, how a choice is judged, and the rules it must obey. Then it sorts problems by whether their pieces are straight or curved, and whether the unknowns must be whole numbers.