# Question

Use the bisection method with an error tolerance ϵ = 0.04 and with the following initial bounds to interactively solve (approximately) each of the following problems.

(a) Maximize f(x) = 6x – x2, with x = 0, x-bar = 4.8.

(b) Minimize f(x) = 6x + 7x2 + 4x3 + x4, with x = – 4, = 1,

(a) Maximize f(x) = 6x – x2, with x = 0, x-bar = 4.8.

(b) Minimize f(x) = 6x + 7x2 + 4x3 + x4, with x = – 4, = 1,

## Answer to relevant Questions

Consider the following problem: Maximize f(x) = 48x5 + 42x3 + 3.5 x – 16x6 – 61x4 – 16.5x2. (a) Apply the bisection method to (approximately) solve this problem. Use an error tolerance ϵ = 0.08 and initial bounds x = ...Consider the following unconstrained optimization problem: Maximize f(x) = 2x1 x2 + x2 – x21 – 2x22. Starting from the initial trial solution (x1, x2) = (0, 0), interactively apply the gradient search procedure with ϵ = 1 to solve (approximately) the following problem, and then apply the automatic routine for this ...Consider the following nonlinear programming problem: Maximize Subject to x1 – x2 ≤ 2 and x1 ≥ 0, x2 ≥ 0. (a) Use the KKT conditions to demonstrate that (x1, x2) = (4, 2) is not optimal. Reconsider the linearly constrained convex programming model given in Prob. 13.4-7. Use the KKT conditions to determine whether (x1, x2) = (2, 2) can be optimal.Post your question

0