Mining Engineering > GATE 2019 > Linear Programming
In the linear programming problem,
Maximize Z=48X1+36X2
Subject to:
X1≤5
X2≤8
2X1+4/3 X2≤16
X1+X2=10
X1≥4, and X1≥0, X2≥0
The value of Z is _________.
Maximize Z=48X1+36X2
Subject to:
X1≤5
X2≤8
2X1+4/3 X2≤16
X1+X2=10
X1≥4, and X1≥0, X2≥0
The value of Z is _________.
Correct : 408
Similar Questions
The feasible region of a linear programming problem is shown in the figure. The maximum value of the objective function Z=4X+3Y is ______________.
The feasible region of a linear programming problem is shown in the figure. The maximum value of the objective function Z=4X+3Y is ______________.
The feasible region of a linear programming problem is shown in the figure. The maximum value of the objective function Z=4X+3Y is ______________.
Total Unique Visitors
Loading......