Question: Consider the following nonlinear programming problem. Maximize Z = x31 + 4x22 + 16x3, Subject to x1 x2 x3 =4 and x1 1, x2
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).
Step by Step Solution
3.56 Rating (153 Votes )
There are 3 Steps involved in it
a Let s n 1 2 4 be the remaining factor 4 entering stage n n ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (621).docx
120 KBs Word File
