Linear Programming Mock Tests

In a linear programming problem, the feasible region is bounded by x ≥ 0, y ≥ 0, x + y ≤ 4, and 2x + y ≤ 6. The maximum value of Z = 3x + 2y is:

In the graphical method of linear programming, the optimal solution (if it exists) always occurs at:

In a linear programming problem, the objective function is Z = 5x + 3y. The feasible region has vertices at (0, 0), (0, 5), (4, 3), and (6, 0). The maximum value of Z occurs at:

Minimize Z = 2x + 5y subject to x + 2y ≥ 6, x + y ≥ 4, x ≥ 0, y ≥ 0. The minimum value of Z is:

In a linear programming problem, if the feasible region is unbounded, the optimal value:

Minimize Z = x + 2y subject to x + 2y ≥ 100, 2x − y ≤ 0, x, y ≥ 0. The minimum value of Z is:

The maximum value of Z = 4x + 6y subject to x + y ≤ 2, x ≥ 0, y ≥ 0 is:

A manufacturing company makes two products, A and B. Each product requires processing time on two machines. Product A needs 2 hours on machine 1 and 1 hour on machine 2. Product B needs 1 hour on machine 1 and 2 hours on machine 2. Machine 1 has 8 hours available and machine 2 has 7 hours available. If the profit per unit is Rs 2 for A and Rs 3 for B, what is the maximum profit?