Ch 5 Linear Inequalities and Linear Programming Class 12

1 / 25

If the line segment obtained by joining any two points of a region lies entirely within theregion , then the region is called

2 / 25

The non-negative constraints are also called

3 / 25

Linear inequality ?? − ?? > 3 is satisfied by the point

4 / 25

? = ? is in the solution of the inequality

5 / 25

For feasible region:

6 / 25

Corner point is also called

7 / 25

Solution space consisting of all feasible solutions of system of linear in inequalities is called

8 / 25

The feasible solution which maximizes or minimizes the objective function is called

9 / 25

The graph of the inequality ?? + ?? ≥ ? is _____ side of line ?? + ?? = ?

10 / 25

The graph of the inequality ?? + ?? ≤ ? is _____ side of line ?? + ?? = ?

11 / 25

The graph of the inequality ? ≤ ? is

12 / 25

13 / 25

The graph of a linear equation of the form ?? + ?? = ? is a line which divides the wholeplane into ______ disjoints parts.

14 / 25

The graph of corresponding linear equation of the linear inequality is a line called________

15 / 25

?? + ?? < ? is not a linear inequality if

16 / 25

An inequality with one or two variables has ________ solutions.

17 / 25

A linear inequality contains at least _________ variables.

18 / 25

The symbols used for inequality are

19 / 25

If ? > ? then

20 / 25

The point where two boundary lines of a shaded region intersect is called _____ point.

21 / 25

(0,0) is satisfied by

22 / 25

(0,0) is the solution of the inequality

23 / 25

The number of variables in ?? + ?? ≤ ? are

24 / 25

A function which is to be maximized or minimized is called______ function

25 / 25

he solution of ?? + ? < ? is

Your score is

The average score is 58%

Restart quiz

Ali Durrani