Question

In: Advanced Math

Solve the following problem by Dynamic Programming: Maximize z = (y1 + 2)^2 + y2 *...

Solve the following problem by Dynamic Programming:
Maximize z = (y1 + 2)^2 + y2 * y3 + (y4 - 5)^2
subject to
y1 + y2 + y3 + y4 <= 5
yi >= 0 and integer, i = 1, 2, 3, 4

Solutions

Expert Solution

problem becomes

Max subject to for which we get

problem becomes

Max subject to for which we get

problem becomes

Max subject to

Which has max value

problem becomes

Max subject to

Which has max value for

problem becomes

Max subject to

If then

If problem becomes Max subject to

Which has max value for

If problem becomes subject to for which max value is 32 again for

If problem becomes subject to for which max value is 41 for

If problem becomes subject to for which max value is 36 for

makes our problem Max subject to

Which has max value

makes our problem Max subject to

Which has max value

Thus, the overall maximum value is attained when

And the value is

Hope this was helpful. Please do leave a positive rating if you liked this answer. Thanks and have a good day!


Related Solutions

Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 +...
Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 + 200 x 2 Subject to : X1 + 8X2 <= 24 X1 + 2X2 <= 12 X1 >= 0 , X2 >= 0 You will need to graph each of the constraints to answer the following questions. You can draw a rough graph. a) State the coordinates of the point where the constraints interact. b) Define in words the region of feasible solutions. c)...
Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2...
Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2 + 5 x3 subject to x1 + x2 + x3 <= 25 2 x1 + x2 + x3 <= 40 x1 + x2          <= 25                    x3 <= 6 x1, x2, x3 >= 0 (non-negativity conditions)
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
Use the simplex method to solve the following problem. Find y1 ≥ ​0, y2 ≥ ​0,...
Use the simplex method to solve the following problem. Find y1 ≥ ​0, y2 ≥ ​0, and y3 ≥ 0 such that 2 y1 + 7 y2 + 3 y3 ≤ 11​, 2 y1 + 14 y2 + 8 y3 ≥ 1010​, and w = 12 y1 + 42 y2 + 59 y3 is minimized. The minimum value w = ___ occurs when y1 = ___​, y2 = ___​, and y3 = ___. ​(Simplify your​ answers.)
Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 +...
Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 + 2x2 Subject to constraints: 3x1 + 2x2 <=9 x1 + 3x2 <= 5 when x1, x2 >=0
5. Design a dynamic programming algorithm to solve the following problem. Input: An array A[1, ....
5. Design a dynamic programming algorithm to solve the following problem. Input: An array A[1, . . . , n] of positive integers, an integer K. Decide: Are there integers in A such that their sum is K. (Return T RUE or F ALSE) Example: The answer is TRUE for the array A = [1, 2, 3] and 5, since 2 + 3 = 5. The answer is FALSE for A = [2, 3, 4] and 8. Note that you...
Solve the linear programming problem. Maximize z=15x+15y , Subject to 9x+7y greater than or equals 153...
Solve the linear programming problem. Maximize z=15x+15y , Subject to 9x+7y greater than or equals 153 , 13x-11y greater than or equals 31 , x+y less than or equals 43 , x,y greater than or equals 0 What is the maximum value of​ z? Select the correct choice below and fill in any answer boxes present in your choice. A. z=( ? ) ​(Type an integer or a​ fraction.) B. There is no maximum value of z. At what corner​...
Solve the following linear programming problem. Restrict x ≥ 0 and y ≥ 0. Maximize f...
Solve the following linear programming problem. Restrict x ≥ 0 and y ≥ 0. Maximize f = 3x + 5y subject to x + y ≤ 5 2x + y ≤ 8 y ≤ 4.
We define a relation ∼ on R^2 by (x1,y1)∼(x2,y2) if and only if (y2−y1) ∈ 2Z....
We define a relation ∼ on R^2 by (x1,y1)∼(x2,y2) if and only if (y2−y1) ∈ 2Z. Show that the relation∼is an equivalence relation and describe the equivalence class of the point (0,1).
Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y    ...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 8 x ≥ 0, y ≥ 0  
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT