Solve the following LP problem by dynamic programming approach.

6.7kviews

written 9.4 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

Sarwansra681 • 10

Use Dynamic programming to solve the following problems :- maximize z=8x1 + 7x2 subject to constraints 2x1 + x2 <8, 5 x1 + 2x2 < 15, and x1, x2 > 0.

operation research

ADD COMMENT EDIT

1 Answer

502views

written 9.4 years ago by

teamques10 ★ 70k

Stage I:

$F_1$ $= \text{Maximize} \ 8X_1 \\ = 8 \max. (X_1)$

From the constraints:

$2X_1 + X_2 ≤ 2 → X_1 ≤ \dfrac{2 - X_2}{2} \\ 5X_1 + 2X_2 ≤ 15 → X_1 ≤ \dfrac{15 - 2X_2}{5} \\ So \ X_1 ≤ \min. \bigg[\dfrac{2 - X_2}{2} ,\dfrac{15 - 2X_2}{5}\bigg] …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.