# Question

Consider the following problem:

Maximize f(x) = x3 + 30x – x6 – 2x4 – 3x2.

(a) Apply the bisection method to (approximately) solve this problem. Use an error tolerance ϵ = 0.07 and find appropriate initial bounds by inspection.

(b) Apply Newton’s method, with ϵ = 0.001 and x1 = 1, to this problem.

Maximize f(x) = x3 + 30x – x6 – 2x4 – 3x2.

(a) Apply the bisection method to (approximately) solve this problem. Use an error tolerance ϵ = 0.07 and find appropriate initial bounds by inspection.

(b) Apply Newton’s method, with ϵ = 0.001 and x1 = 1, to this problem.

## Answer to relevant Questions

Consider the following convex programming problem: Minimize Z = x4 + x2 – 4x, Subject to x ≤ 2 and x ≥ 0. Starting from the initial trial solution (x1, x2) = (0, 0), interactively apply the gradient search procedure with ϵ = 0.3 to obtain an approximate solution for the following problem, and then apply the automatic routine ...Reconsider Prob. 13.2-9. Use the KKT conditions to check whether (x1, x2) = (1/√2, 1/ √2) is optimal. What are the KKT conditions for nonlinear programming problems of the following form? Minimize f(x) Subject to gi(x) ≥ bi, for i = 1, 2, . . . ,m and x ≥ 0, Consider the quadratic programming example presented in Sec. 13.7. (a) Use the test given in Appendix 2 to show that the objective function is strictly concave. (b) Verify that the objective function is strictly concave by ...Post your question

0