Mining Engineering > GATE 2018 > Linear Programming
The feasible region of a linear programming problem is shown in the figure. The maximum value of the objective function Z=4X+3Y is ______________.
Correct : 74.0
Similar Questions
A linear programming problem is given as: Maximize Z=4x1+2x2 Subject to: 2x1-2x2≤20 4x1≤80 x1≥0, x2≥0 The problem has
A linear programming problem is stated below. Maximize Z=3x1+5x2 subject to, 2x1+x2≤8 6x1+8x2≤30 x1,x2≥0 The objective function has
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...
Total Unique Visitors
Loading......