Linear Programming Questions

The maximum value of the objective function $Z=4x+3y$ subject to $4x+2y\le 12$, $2x+4y\ge 6$, $x\ge 0,y\ge 0$ is:

The activities or limitations competing with one another to share the amount of resources in linear programming are called:

Durgesh works in a restaurant preparing two types of dishes, A and B. Dish A takes 20 minutes to prepare and Dish B takes 30 minutes. He earns Rs 50 for dish A and Rs 70 for dish B. He works for 12 hours a day and needs 1 hour for personal activities. What will be the time constraint if formulated as a linear programming problem? Assume $x$ and $y$ are the packets of dishes A and B respectively.

The number of solutions in a linear programming model to maximize $5x+4y$ subject to $x-2y\ge 2$, $2x-4y\le -3$, and $x,y\ge 0$ will be: