Which one of the following inequalities is redundant for the shaded feasible region (ABCDA) shown below? <img src="https://balti.afterboards.in/BMA5vBPSyJrH2hF" width="300px"/>

The maximum value of the objective function $z = 2x + 3y$ of an L.P.P. subjected to the constraints $x - y \le 1$, $x + y \le 3$, $x, y \ge 0$ is

A LPP $max\,Z = 3x + 8y$ subjected to the constraints $2x + y \le 10$, $x + 3y \le 15$, $x,y \ge 0$, then $max\,Z$ is

The feasible region for a LPP is shown in the given figure. The maximum value of $z = 2x + 5y$ is :

A manufacturing unit makes two models, 'classic' and 'supreme' of the scooter. Each piece of the classic model requires 9 labour hours for assembling and 1 labour hour for finishing. Each piece of supreme model requires 12 labour hours for assembling and 3 labour hour for finishing. For assembling and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹ 10000 on each piece of the classic model and ₹ 15000 on each piece of the supreme model. Which of the following options describes the given Linear Programming Problem (LPP) to maximize the profit Z (Max Z) (where x and y are the number of pieces of the classic model and the supreme model respectively)?

In an LPP, the feasible region represented by the set off constraints $2x + 3y \leq 18$, $x + y \leq 10$, $x \geq 0$, $y \geq 0$ is

For any linear programming problem the feasible region is shaded region as given below, then constraints are: