Write a computer code to perform the gradient method of steepest ascent algorithm
using the Golden Section Search Method (presented in Section 7.6) to maximize the
function:

to obtain  λ=λk at each step determining the next point (x_k+1, y_k+1) in Equations (13.4).
Use your code to solve Problems 6 and 7 of this section.

Equation 13.4

Data from problem 6

If x and y are the amounts of labor and capital, respectively, to produce:

Data from problem 7

The total cost to manufacture one unit of product A is $3, and for one unit of product B it is $2. If x and y are the retail prices per unit of A and B, respectively, then marketing research has established that:

Data from section 7.6

Figure 7.24

g() = f(xk + XVf(xk))