1. All optimum design algorithms require a starting point to initiate the iterative process.

false
2. A vector of design changes must be computed at each iteration of the iterative process. True
3. The design change calculation can be divided into step size determination and direction finding
subproblems. True
4. The search direction requires evaluation of the gradient of the cost function. True
5. Step size along the search direction is always negative. False
6. Step size along the search direction can be zero. False
7. In unconstrained optimization, the cost function can increase for an arbitrary small step along the
descent direction. False
8. A descent direction always exists if the current point is not a local minimum. True
9. In unconstrained optimization, a direction of descent can be found at a point where the gradient of
the cost function is zero. False
10. The descent direction makes an angle of 0–90° with the gradient of the cost function. False

1. Step size determination is always a one-dimensional problem. True

2. In unconstrained optimization, the slope of the cost function along the descent direction at zero
step size is always positive. False
3. The optimum step lies outside the interval of uncertainty. False
4. After initial bracketing, the golden section search requires two function evaluations to reduce the
interval of uncertainty. False