Linear Programming

State the limitations of L.P.P.

Define L.P.P and its advantages.

A candle plant manufactures two types of products $X$ and $Y$ and sells them at a profit of $₹5$ on type $X$ and $₹3$ on type $Y$. Each product is processed on two machines $G$ and $H$. Type $X$ requires one minute of processing time on $G$ and two minutes on $H$; type $Y$ requires one minute on $G$ and one minute on $H$. The machine $G$ is available for not more than $6 \mathrm{hours} 40 \mathrm{minutes}$, while machine $H$ is available for $8 \mathrm{hours} 20 \mathrm{minutes}$ during any working day; formulate the problem as linear programming problem.

Define unbounded feasible region in linear programming.

The bounded feasible region for a linear programming problem (LPP) is given as below:

Which one of the following can be optimal solution for the given LPP.

Which one of the following is infeasible solution to the linear programming problem (LPP), whose feasible region is given by:

The linear inequalities or equations or restrictions on the variables of a linear programming problem (L.P.P.) are called:

The common region determined by all the constraints and non-negativity restrictions of the L.P.P. is called

The optimal value of the objective function is attained at the points

Cotyledons are also called-