EASY
Earn 100

The solution set of the inequation is
(a)Half plane not containing the origin
(b)Half plane containing the origin
(c)The point being on the line
(d)None of these.

50% studentsanswered this correctly
Important Questions on Algebraic Inequalities
MEDIUM
The feasible region of an LPP is shown in the figure. If , then the maximum value of occurs at

EASY
The maximum value of subject to constraints and is

HARD
If subject to then the minimum value of is

MEDIUM
The minimum value of subject to the constraints and is

HARD
The maximum value of subject to is

EASY
The most correct statement is

MEDIUM
Corner points of the feasible region determined by the system of linear constraints are and . Let , where . Condition on and so that the minimum of occurs at and is

HARD
The minimum value of the function , subjected to the constraints , is

EASY
For L. P. P, maximize subject to has ….

EASY
The coordinates of the point at which minimum value of subject to constraints is attained, is

EASY
The feasible region of an is shown in the figure. If , then the minimum value of occurs at

MEDIUM
What is the area of the region enclosed by the inequalities and

EASY
The corner points of the feasible region determined by the system of linear constraints are and Let where Condition on and so that the maximum of occurs at both the points and is _________.

MEDIUM
The L.P.P. to maximize subject to has

EASY
The corner points of the feasible region determined by the system of linear constraints are Let where . Condition on and so that the maximum of occurs at both the points and , is

HARD
A furniture trader deals in only two items - chairs and tables. He has rupees to invest and a space to store at most items. A chair costs him rupees and a table costs him rupees . The trader earns a profit of rupees and rupees on a chair and table, respectively. Formulate the above problem as an LPP to maximise the profit and solve it graphically.

MEDIUM
Consider a Linear Programming Problem:
Minimize Subject to : and
Which one of the following points lies outside the feasible region?

HARD
The maximum value of subject to constraints is

HARD
The objective function subject to has minimum value at the point

HARD
A system of linear equations in two variables, and is given as Which of the following would be one of the values of for which the given system of linear equations is consistent?

