Linear Programm...

Objective of linear programming for an objective function is to

If the feasible region for a solution of linear inequations is bounded, it is called as:

If an iso-profit line yielding the optimal solution coincides with a constaint line, then

Graphical method can be used only when the decision variables is

Objective of LPP is

The shaded part of a given figure indicates the feasible region, then the constraints are

The feasible solution of an LP problem, is ________

The corner points of the feasible region determined by the system of linear constraints are $$(0, 10),(5, 5), (25, 20)$$ and $$(0, 30)$$. Let $$Z = px + qy$$, where $$p, q > 0$$. Condition on $$p$$ and $$q$$ so that the maximum of $$Z$$ occurs at both the points $$(25, 20)$$ and $$(0, 30)$$ is _______.

The taxi fare in a city is as follows: For the first kilometre, the fare is Rs. $$8$$ and the subsequent distance it is Rs. $$5$$ per km. Taking the distance covered as x km and fare as Rs y, write a linear equation.