Home/ Questions/Q 7456
Next
In Process

SIKSHAPATH Latest Questions

SUMIT
  • 3
  • 3
Asked: 2021-11-21T14:37:09+05:30 In:

Solve the following problem using DPP Maximize                          Z = 2×1+5×2 Subject to constraints:        2×1+x2 ≤430 2×2 ≤ 460, x1, x2≥ 0  

  • 3
  • 3

Solve the following problem using DPP Maximize                          Z = 2x1+5x2 Subject to constraints:        2x1+x2 ≤430 2x2 ≤ 460, x1, x2≥ 0   Solve the following problem using DPP Maximize                          Z = 2x1+5x2 Subject to constraints:        2x1+x2 ≤430 2x2 ≤ 460, x1, x2≥ 0  

use dynamic programming to solve the following lpp max z=2x1+5x2
Share

    1 Answer

    2. I'M ADMIN

    Leave an answer

    You must login to add an answer.

    Need An Account,