If for a linear programming problem the feasible region is bounded,then the objective function has . . . . . . .

The corner points of the feasible region are $A(0,0)$,$B(16,0)$,$C(8,16)$,and $D(0,24)$. The minimum value of the objective function $z = 300x + 190y$ is . . . . . . .

An aeroplane can carry a maximum of $200$ passengers. $A$ profit of $Rs. 1000$ is made on each executive class ticket and a profit of $Rs. 600$ is made on each economy class ticket. The airline reserves at least $20$ seats for executive class. However,at least $4$ times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?

The feasible solution for a $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The minimum value of $z$ occurs at:

Solve the following Linear Programming Problem graphically:
Minimise $Z = x + 2y$
subject to the constraints:
$2x + y \geq 3$
$x + 2y \geq 6$
$x, y \geq 0$

If an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then: