Scribd
Upload
29 views

Chapter 5 2nd Year

Uploaded by

Imran Shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
29 views

Chapter 5 2nd Year

Uploaded by

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

The Sublime Science Academy Rajanpur

Linear Inequalities and Linear Programming


Chapter 5(2nd Year) Time: 1 hour

Roll No________ Total Marks:-35

Q1. Tick (✔)the correct answer. (15)


1. An equation in which each term has degree one is called______ equation
(a) Linear (b) Quadratic (c) Cubic (d) None of these
2. The function which is to be maximized or minimized is call_______ function
(a) Bijective (b) Objective (c) Feasible (d) Optimal
3. x=4 is the solution of
(a) x +3>0 (b) x +3=0 (c) x +3<0 (d) x−3=0
4. The associated equation of the linear inequality ax +b ≤ c is
(a) ax=c (b) ax +b=0 (c) ax +b <c (d) ax +b=c
5. All points with x >0 , y >0 lie in ________
(a) 1st Quad (b) 2nd Quad (c) 3rd Quad (d) 4th Quad
6. Each point of a feasible region is called a______
(a) Feasible solution (b) Feasible solution set (c) Corner point (d) None of these
7. A vertical line divides a plane into ______ half plane
(a) Upper ¿ Lower (b) Upper & Right (c) Left & Right (d) Left & Half
8. (0 , 0) is the test point of________
(a) 2 x+3 y ≤ 0 (b) 2 x+3 y ≥ 0 (c) 2 x+3 y =0 (d) None of these
9. A feasible region is restricted to _______
(a) 1st Quad (b) 2nd Quad (c) 3rd Quad (d) 4th Quad
10. To find the optimal solution , we evaluate the objective function at_____
(a) Only origin (b) Corner points (c) any point (d) None of these
11. x−intercept for x +2 y=6 is
(a) 1 (b)2 (c) 6 (d) 12
12. Non-negative constraints are also known as
(a) Dependent variables (b) Discrete variables (c) feasible region (d) None of these
13. The common region of all graphs is called
(a) Feasible region (b) solution region (c) both (a) and (b) (d) None of these
14. (2 , 1) is one of solutions of the inequality
(a) x− y >1 (b) 3 x+ 5 y< 6 (c) 2 x+ y< 7 (d) None of these
15. A point (x , y ) which satisfy a linear inequality in two variables x and y form its
(a) Domain (b) range (c) solution (d) None of these

Q2. Short questions (10)


i. Define Objective function and Optimal solution
ii. Graph the solution set of linear inequality
3 x−2 y ≥ 6 , 3 y−4 ≤ 0
iii. Define feasible region.
iv. Shade the solution of x + y ≤ 5
v. Define Corner Point.

Q3. Graph the feasible region of the following system of linear inequalities
and find the corner points (5)
2 x+ y ≤ 10 ; x +4 y ≤ 12 ; x +2 y ≤ 10 ; x ≥ 0 , y ≥0

Q4. Maximize f ( x , y )=2 x+3 y subject to the constraints:


2 x+ y ≤ 8 ; x +2 y ≤ 14 ; x ≥ 0 , y ≥0 (5)

You might also like