Search for question
Question
2. Construct a linear programming model with all the variables constrained to be positive.(No need to solve the LP model): Minimize Z = 40x1+ 50x2 subject to 2x1 + 3x2
>= 30 x1 + x2 >= 12 2x1 + x2 >= 20 x1 >= -25, x2 >= 0.
Fig: 1
Fig: 2
Fig: 3
Fig: 4
Fig: 5
Fig: 6
Fig: 7
