Question: Consider the following nonconvex programming problem: Maximize f(x) = 1,000x 400x2 + 40x3 x4, Subject to x2 + x 500 and x

Consider the following nonconvex programming problem:
Maximize f(x) = 1,000x – 400x2 + 40x3 – x4,
Subject to x2 + x ≤ 500 and x ≥ 0.
(a) Identify the feasible values for x. Obtain general expressions for the first three derivatives of f(x). Use this information to help you draw a rough sketch of f(x) over the feasible region for x. Without calculating their values, mark the points on your graph that correspond to local maxima and minima.
(b) Use the bisection method with ϵ = 0.05 to find each of the local maxima. Use your sketch from part (a) to identify appropriate initial bounds for each of these searches. Which of the local maxima is a global maximum?

Step by Step Solution

3.40 Rating (169 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Solving for the roots of x 2 x 500 0 one observes that x is ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

545-M-S-L-P (795).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!