Scribd
Upload
7 views9 pages

Math Practice Sheet P-2-Ch.5

Cuiughh ...... ......

Uploaded by

haseebshorts6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views9 pages

Math Practice Sheet P-2-Ch.5

Cuiughh ...... ......

Uploaded by

haseebshorts6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

MATHEMATICS

F.Sc / ICS – 2nd Year


Practice Sheet Chapter 5
MCQs
(1) Solution set of inequality 2 x  3 is:
 3 3   3 3 
(A)  ,  (B)  ,   (C)  ,   (D)  , 
 2 2   2 2

(2) A function which is to be maximized or minimized is called:


(A) Subjective function (B) Quantitative function
(C) Objective function (D) Qualitative function

(3) ax  by  c is:
(A) Linear inequality (B) Identity
(C) Equation (D) Not inequality

(4) The feasible solution which maximizes or minimizes the objective function is called:
(A) Exact solution (B) Optimal solution
(C) Final solution (D) Objective solution

(5) System of linear inequalities involved in the problem is called:


(A) Coefficients (B) Solution (C) Problem constrains (D) Boundaries

(6) The solution set of the inequality ax  by  c is the:


(A) Parabola (B) Half plane (C) Circle (D) Hyperbola

(7) The solution of the inequality x  2 y  6 is:


(A) (1,1) (B) (1,3) (C) (1,4) (D) (1,5)

(8) x  5 is the solution of inequality:


(A) 2x  3  0 (B) 2x  3  0 (C) x  4  0 (D) x  3  0

(11) (0, 0) is the solution of inequality:

(A) 7 x  2 y  3 (B) x  3 y  0 (C) x  2 y  6 (D) x  3 y  0


(12) (3, 2) is not a solution of the inequality:

(A) x  y  1 (B) x  y  2 (C) 3x  5 y  8 (D) 3x  7 y  3

SHORT QUESTIONS
1. Define a linear inequality. (SWL 24, G-II)

2. Define corner point. (FSD 24, G-I)

3. Define convex region. (RWP 24, G-II)

4. Define Problem constraints.

5. Define feasible region and feasible solution set. (LHR 24, G-I), (LHR 24, G-II), (GRW 24, G-I),
(GRW 24, G-II), (RWP 24, G-I), (SGD 24, G-II), (D.G.Khan 24, G-I), (D.G.Khan 24, G-II), (MUL 24, G-II)

6. Define decision variables. (MTN 24, G-I)

7. Define objective function. (SGD 24, G-I)


8. Define optimal solution. (FSD 24, G-II), (BWP 24, G-II)

9. Graph the feasible region of inequality 3x  2 y  6 , x  0 , y  0 . (GRW 24, G-I)

10. Graph the solution set of inequality


(i) 5x  4 y  20 (FSD G-I), (LHR 24, G-II), (SWL 24, G-II)

(ii) 3x  2 y  6 (LHR 24, G-I), (SGD 24, G-I)

(iii) x  2y  6 (MTN 24, G-I)

(iv) 3x  7 y  21 (RWP 24, G-I)


(v) 2x  1  

(vi) 3y  4  0 (RWP 24, G-II)

(vii) 2 x  3 y  12 (MTN 24, G-II)

11. Graph the solution set of system of linear inequalities by shading

(i) 3x  7 y  21, y  4

3
(ii) 4 x  3 y  12, x   (GRW 24, G-I)
2
(iii) 3x  7 y  21, x  y  2 (FSD 24, G-II), (D.G.Khan 24, G-II)

12. Graph the solution set of the system of linear inequalities by shading 3x  7 y  21, x  y  2, y  0

13. Graph the solution region of the system of linear inequalities x  y  5, y  2 x  2, x  0


LONG QUESTIONS
1. Graph the feasible region of the following system of linear inequalities and find the corner points
2 x  3 y  6, 2 x  3 y  12, x  0, y  0 . (GRW 24, G-II)

2. Graph the feasible region of linear inequalities and find corner points:
2 x  3 y  18 ; 2 x  y  10 ; x  4 y  12 (FSD 24, G-II), (MTN 24, G-II)
3. Maximize f ( x, y)  2 x  5 y subject to the constraints 2 y  x  8, x  y  4, x  0, y  0

(LHR 24, G-II), (GRW 24, G-I), (SWL 24, G-II), (SGD 24, G-I), (MTN 24, G-I)

4. Maximize f ( x, y)  x  3 y subject to the constraints 2 x  5 y  30, 5x  4 y  20, x  0, y  0


(LHR 24, G-I), (D.G.Khan 24, G-I), (D.G.Khan 24, G-II)
5. Minimize z  2x  y subject to the constraints x  y  3, 7 x  5 y  35, x  0, y  0
(RWP 24, G-II), (SGD 24, G-II)

6. Maximize f ( x, y)  2 x  3 y subject to the constraints 2 x  y  8, x  2 y  14, x  0, y  0


(BWP 24, G-II)
7. Minimize z  3x  y subject to the constraints 3x  5 y  15, x  6 y  9, x  0, y  0 (FSD 24, G-I)

You might also like