Consider the following convex programming problem. Maximize f( x ) = 10x 1 – 2 x 1 2 – x 1 3 + 8 x 2 -x 2 2 subject to x 1 + x 2 2 and x 1 0, x 2 0.

ORDER NOW