Scribd
Upload
84 views5 pages

Maths

The document contains a 25 question quiz on linear programming problems (LPP). The questions cover topics such as identifying the objective function in an LPP, defining constraints, determining feasible regions and corner/boundary points, finding maximum/minimum values of objective functions, and properties of LPPs. An answer key is provided with the correct response for each multiple choice question.

Uploaded by

Yogita
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
84 views5 pages

Maths

The document contains a 25 question quiz on linear programming problems (LPP). The questions cover topics such as identifying the objective function in an LPP, defining constraints, determining feasible regions and corner/boundary points, finding maximum/minimum values of objective functions, and properties of LPPs. An answer key is provided with the correct response for each multiple choice question.

Uploaded by

Yogita
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/ 5

Venue SV K2 Block Mangolpuri

Teacher Participants: Mrs Pankaj Kathuria


Mrs Archana Sachdev
Mrs.Madhu
Mrs.Vijaya
Mrs Sunita
Group : 6. Topic : Linear Programming

Q1. In a LPP, the objective function is always


(a) Cubic
(b) Quadratic
(c) Linear
(d) Constant

Q2. In an LPP, conditions x≥0 ,y≥0 are called


(a) restrictions
(b) negative restrictions
(c) Non-Negative Restrictions
(d) none of the above

Q3. The maximum value of Z=0.7x+y for feasible regions given below is

(a) 45
(b) 40
(c) 50
(d) 41

Q4. Consider a LPP given by Min. Z=6x+10y subject to x≥6 ,y≥2 ,2x+y≥10 x,y ≥0 redundant
constraints in this LPP are
(a) x≥0 ,y≥0
(b) x≥6,2x+y≥10
(c) 2x+y≥10
(d) none of these

Q5 Z=3x+4y subject to the constraints x+y≤1 ,x, y ≥0 the shaded region shown in fig. as OAB with
bounded region and coordinates of corner points O ,A and B are (0,0) (1,0) and (0,1) respectively.The
maximum value of that is 2

(a) True
(b) False
(c) Can't say
(d) Partially true

Q6. The set of all feasible solutions of an LPP is a ___________ set.


(a) Concave
(b) Convex
(c) Feasible
(d) None of these

Q7. In an LPP, if objective function z = ax + by has the same maximum value on two corner
points of the feasible region, then every point on the line segment joining these two points
give the same ________ value.
(a) Minimum
(b) Maximum
(c) Zero
(d) None of these

Q8. Shape of the feasible region formed by the following constraints x+y≤2, x+y≥5, x≥0, y≥0
(a) No Feasible Region
(b) Triangular Region
(c) Unbounded Region
(d) Trapezium

Q9. The region represented by the inequalities x≥6, y≥2, 2x+y≤0, x≥0, y≥0
(a) Unbounded
(b) Polygon
(c) Exterior of a Triangle
(d) None of these

Q10. Shape of the following region formed by the following constraints x+y≤2, x+y≥5, x≥0, y≥0
(a) Concave
(b) Convex
(c) Feasible
(d) None of these

Q 11. For a given LPP


Max z=x+y subject to constraints x+4y≤8, 2x+3y≤12, 3x+y≤9, x≥0, y≥0. Which of the following is
not a corner point?
(a) (3,0)
(b) (0,2)
(c) (15/11 , 28/11)
(d) (0,0)

Q12. The objective function of an LPP is


(a) A constant
(b) An inequality
(c) A quadratic expression
(d) A linear function to be optimized

Q13. The variable of the objective function of the linear programming problems are
(a) Zero
(b) Zero or Positive
(c) Negative
(d) Zero or Negative

Q14. Corner points of the feasible region determined by the system of linear constraints are
(0,3), (1,1) and (3,0). Let z= px+qy where p,q>0. Condition on p and q so that the minimum
of Z occurs at (3,0) and (1,1) is
(a) p=2q
(b) p=q/2
(c) p=3q
(d) p=q

Q15. The maximum value of z=0.7x+y for feasible region given below is

(a) 45
(b) 40
(c) 50
(d) 41

Q16. The corner point of feasible region determined by the system of linear constraints are
(0, 0) (0,40) (20,40) (60, 20) (60, 0) Objective function is 2x+3y
Compare the quantity in column A and columnB
a) The quantity in column A is greater
b) The quantity in Column B is Greater
c) Two two qualities are equal
d) The relationship cannot be determined on the basis of the information supply

Q17. The corner point of the feasible region determined by the system of linear constants
are (0, 10) (5, 5) (15,15) (0, 20)
Let Z=px+qy where p, q>0 condition on p and q so that the maximum of Z occurs at both the
point (15, 15) and (0, 20) is
a) p=q
b) p=2z
c) q=2p
d) q=3p

Q18. If The constraints of a linear programming problem are changed then


a)The problem is to be re-evaluated
b) solution not defined
c) the objective function has to be modified
d)The change in constraints is ignored

Q19. The graph of the inequality 2 X + 3 Y > 6 is


a) half plane that contains the origin
b) half plane that neither contains the origin nor the points of the line 2 X + 3 Y= 6
c) whole XOY plane excluding the point on the line of 2 X + 3 Y= 6
d) entire XOY plane

Q20. The position of origin (0, 0) w.r.t. feasible region represented by x+y ≥1
a) in the region
b) not in the region
c) on the line x+y=0
d) none of these

Q21. The maximum value of Z= 5 x + 3 Y satisfying the condition x≥0 y≥0, 5x+2y≤10
is
a) 15
b) 30
c) 10
d) 25

Q22. In a linear programming problem the maximum value of objective function Z=px+qy is
always
a) Finite
b) Infinite
c) positive
d) negative

Q23. Max Z=3x+4y subject to the constraints x+y≤4,x≥0, y≥0


a) Max z=16 at (0, 4)
b) Max z=19 at (1, 5)
c) Max z=18 at (1, 4)
d) Max z=17 at (0, 5)

Q24. In an LPP if the objective function z=ax+by has the same maximum value on two
corner points of the feasible region then the number of points of which z Max occurs.
a) 0
b) 2
c) finite
d) infinite

Q25. Corner Points of the feasible region for an LPP are (0,2) (3,0) (6,0) (6,8) and (0,5). Let
Z=4x+6y be the objective function.
Max.of Z - Min. of Z =?
a) 60
b) 48
c) 42
d) 18
ANSWER KEY
1 (c) 2.(c) 3.(d) 4.(c) 5.(b) 6.(a) 7.(b) 8.(a) 9.(d)10.(a)11.(c) 12.(d) 13.(b) 14.(b) 15.(d)
16.(b) 17.(d) 18.(a) 19.(b) 20.(b) 21.(a) 22.(c)
23.(a) 24.(d) 25.(a)

You might also like