Write a computer code to perform the gradient method of steepest ascent algorithm using the multiplier technique

Question:

Write a computer code to perform the gradient method of steepest ascent algorithm using the multiplier technique λk+1 =₰ λk discussed in this section. Use your code to solve Problems 1, 5, 6, and 7 of this section.

Data from problem 1

Find the local maximum value of the function:

f(x, y) = xy - x - y - 2x - 2y + 4

Data from problem 5

A company manufactures x floor lamps and y table lamps each day. The profit in dollars for the manufacture and sale of these lamps is:

P(x, y) = 18x + 2y -0.05x-0.03y +0.02xy - 100 Find the daily production level of each lamp to maximize the

Data from problem 6

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

Q(x, y) = 0.54x -0.02x +1.89y2-0.09y units of output for manufacturing a product, find the values of x and y

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:

and QA = 2750-700x + 200y = 2400 + 150x - 800y QB = are the quantities of each product that will be sold each

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

A First Course In Mathematical Modeling

ISBN: 9781285050904

5th Edition

Authors: Frank R. Giordano, William P. Fox, Steven B. Horton

Question Posted: