Math Chapter 5 Class 12 Linear Inequalities and Linear Programming

by

in

FSC Math MCQs. NUST entry test NET contains most of the Mathematics MCQs. FSC Part 1 Math book MCQs. HSSC Mathematics questions MCQs. Chapterwise mathematics MCQs for first year 11 class MCQs. first-year Math books.




PLS Boost Bundle

Get Access to 20 thousands+ MCQs Including Topical MCQs, Practice Tests, Mock Tests, Solved Past Papers, Flashcards, Notes, FLPS, and Much More.

If ? > ? then

1/34

Corner point is also called

2/34

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

3/34

The symbols used for inequality are

4/34

The solution of ?? + ? < ? is

5/34

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

6/34

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

7/34

Corner point is also called

8/34

(0,0) is the solution of the inequality

9/34

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

10/34

(0,0) is satisfied by

11/34

The symbols used for inequality are

12/34

13/34

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

14/34

A linear inequality contains at least _________ variables.

15/34

16/34

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

17/34

18/34

(0,0) is satisfied by

19/34

A linear inequality contains at least _________ variables.

20/34

An inequality with one or two variables has ________ solutions.

21/34

For feasible region:

22/34

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

23/34

The non-negative constraints are also called

24/34

(0,0) is the solution of the inequality

25/34

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

26/34

27/34

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

28/34

An inequality with one or two variables has ________ solutions.

29/34

30/34

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

31/34

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

32/34

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

33/34

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

34/34

BIG SALE! FLAT 50% OFF

Protected

Open chat
Salam
Can we help you?