# Question: Consider the following nonlinear programming problem Maximize Z x31

Consider the following nonlinear programming problem.

Maximize Z = x31 + 4x22 + 16x3,

Subject to

x1 x2 x3 =4

and

x1 ≥ 1, x2 ≥ 1, x3 ≥ 1.

(a) Solve by dynamic programming when, in addition to the given constraints, all three variables also are required to be integer.

(b) Use dynamic programming to solve the problem as given (continuous variables).

Maximize Z = x31 + 4x22 + 16x3,

Subject to

x1 x2 x3 =4

and

x1 ≥ 1, x2 ≥ 1, x3 ≥ 1.

(a) Solve by dynamic programming when, in addition to the given constraints, all three variables also are required to be integer.

(b) Use dynamic programming to solve the problem as given (continuous variables).

## Answer to relevant Questions

Consider the following nonlinear programming problem. Maximize Z = x1 (1 – x2) x3, Subject to x1 – x2 + x3 ≤ 1 and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Use dynamic programming to solve this problem. A political campaign is entering its final stage, and polls indicate a very close election. One of the candidates has enough funds left to purchase TV time for a total of five prime-time commercials on TV stations located in ...Consider the following statements about solving dynamic programming problems. Label each statement as true or false, and then justify your answer by referring to specific statements in the chapter. The Toys-R-4-U Company has developed two new toys for possible inclusion in its product line for the upcoming Christmas season. Setting up the production facilities to begin production would cost $50,000 for toy 1 and ...A young couple, Eve and Steven, want to divide their main household chores (marketing, cooking, dishwashing, and laundering) between them so that each has two tasks but the total time they spend on household duties is kept ...Post your question