0% found this document useful (0 votes)
138 views7 pagesLPP
Uploaded by
KushagraCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
138 views7 pagesLPP
Uploaded by
KushagraCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 7
Chapter
Linear Programming
1. Inan LPP, if the objective function 2 = wx+ by has
the same maximum value on two comer points of
the feasible region, then the number of points at
‘which Zac Occurs is ICBSE - 20201
@o
© 2
(©) finite
(2) infinite
2. The graph of the inequality 2x+3y> 6 is:
IcBSE - 20201
half plane that contains the origin
half plane that neither contains the origin nor
the points of the line 2x+ Sy =
whole XOY-plane excluding the points on the
line 2 +3y=6
(a) entire XOY plane.
3. Which of the following types of problems cannot
bbe solved by linear programming methods?
(@)_ Transportation problem
(©) Manufacturing problems
(©) Traffic signal control
(A) Diet problems
4. The optimal value of the objective function is
attained al the points
(@) Corner points ofthe feasible region
(©) Any point of the feasible region
© onxaxis
(A) ony-axis
5. An optimisation problem may involve finding
(@)__ maximum profit
(©) minimum eost
(©) minimum use of resources
(a) Allofthe above
6. The condition x20, 2 0are called :
(@)_ restrictions only
(©) negative restrictions
(©) non-negative restrictions
(None of the above
7. The feasible region for the an LPP is shown in this
following figure. Then, the minimum value of Z =
t+ 7y
@)
©)
©
8
@ a
© 0 @) 31
‘The maximum value of Z = 4y + 3y, ifthe feasible
region for the an LPP is shown below
100
(@ mm ©)
(© 72 @) 110
In which of the following problems (6), linear
programming can be used :
{@) manufacturing problems
(b) diet problems
(6). transportation problems
(a) Allof these
Corner points of the feasible region for an LPP are
2), 8,0), 6,0), (6,8) and (0,5).
Let F = 4x + 6y be the objective function. The
minimum value of F occurs at
(@) ,2)only
() G,only
(©) the mid-point on the line segment joining, the
points (0,2) and (3,0) only
(d) any point on the line segment joining the points
@.2)and @,0) un.
2B.
4.
15.
16.
v.
18.
vw.
‘The comer points ofthe feasible region determined
by the following system of linear inequal
Bey £10, 2434 215,x, y 2 0are (0,0), 6, 0),,4)
and (0,5). Let = px + gy, where p,4>0. Condition
‘on and, so thal the maximum of Zoccursat both
6,4) and (0,5) is
@ p=a
© p=30
() p=24
(@ 9-9
. The variable x and y in a linear programming
problem are called:
(@) decision variables (6) Unear variables
© optimal variables (d) None of these
The linear inequalities or equations or restrictions
‘on the variables ofa linear programming problem
are called:
(@) linear relations (b)_ constraints
(©) functions, (a) objective functions
‘The objective function of an LPP is
(@) aconstraint
(©) a function to be optimised
(©) arelation between the variables
(2) None of the above
Which of the term is not used in a linear
programming problem?
(@) Optimal solution (b) Feasible solution
(© Concave region (d)_ Objective function
Which of the following sets are not convex ?
@) Gy:2etSy<7 () Gye
© @ixp=5 (@) Gy :3t+aes6
‘The optimal value of the objective function is
attained at the point i
(@) given by intersection of incquations with axes
only
(b)_ given by intersection of inequations with X-axis
only
(© given by comer points of the feasible region
(A). None of the above.
‘The feasible solution for a LPP shown in Fig, Let Z
= 3r- dy be the objective function. Minimum of Z
occurs at:
y
@.0) 6.0)
fa) 0.0) ©) @8)
©) 6,0) (2) @,10)
Refer to Question 18, Maximum of Z occurs at:
(@) 6,0) ©) 5)
(©) 68) @ 410
a
24.
26,
27.
Refer to Question 18. (Maximum value of Z +
Minimum value of Z) is:
@o 1
© -B @ -17
Feasible region in the set of points which satisfy :
(@) The objective functions
(©) Some the given funetions
(©) Allofthe given constriants
(A) None of these
The region of feasible solution in LPP graphic
method is called.
(@) Infeasible region (b) unbounded region
(© Infinite region (@)_feasible region
In equation 3x—y23 and 4x —4y>4:
(@) Have solution for positive x and y
(©) Have no solution for positive xand y
(©) Have solution forall x
(2) Have soluton for ally
The corner point of the feasible region determined
by the system of lincar constraints are 0, 0) (0,30),
(20, 40), (60, 20), 60, 0). The objective function is Z
= 4x + 3y. Compare the quantity in Column A and
Column B:
GOLA
Max Z
@ Quantity in column A is greater
(©) Quantity in column A is greater
(© Two quantities are equal
(@) Relationship cannot be determined and the
basis of information supplied
Ina LPP, the objective function is always:
Col. B
@) cubic (©) quadratic
(9 linear (@)_ constant
Maximise, 7.=— x+y, subject to the constraints
ESreye5,xe2y26, 920
(a) Max, Z=12 at (2, 6)
(b) Zhas no max. value
( Max, Z=10 at 26)
(d) Max., Z= 14 at (2, 6)
A linear programming problem is one that is
concerned with :
(@) finding the upper limits of a linear fanetion of
several variables
(©) finding the lower limit of a linear function of
several variables
finding the limiting values of a liver function
of several variables
finding the optimal value (max of min) of a
linear function of several variables
Objective function is expressed in terms of the
©
@
(@ Numbers () Symbols
(©) Decision variables {d}_None of these 29. In a transportation problem, with 4 supply point
and 5 demand points how many number of
contraints required in its formulation =
@2» ®1 © Ws
30. The feasible region (shaded) fora LPP is shown in
the figure. The max. Z=5x+7y is:
y
8,4)
ce 2) a
za x
as O7 OS W#
31. The position of points O(0, 0) and PC, ~ 2) in the
region of graph of inequation 2x-3y <5, will be:
(@) O inside and P outside
(©) Oand P both inside
(6) Oand P both outside
(@ Ooutside and P inside
32. Let Z = ax + by is a linear objective function
variables v and y are called. variables.
(@) Independent (b)_ Continuous
(6) Decision (@) Dependent
33, Infcasibility means that the number of solutions
to the Tinear programming models that satisfies all
constraints is:
(a) Atleast (b) Aninfinite number
(9) Zero (@)_Atleast2
‘Choose the correct option +
(a) Both (A) and (B) are true and R is the correct
explanation A.
(b) Both (A) and (R) are true but R is not correct
explanation of A.
(©) Aistrue but Ris false
(@)_Ais false but Ris true
34. Assertion (A) : The region represented by the set
(Gr, 4522+ 959) isa converset
Reason (R) : The set (x, ):4<27+y?<9} represents
the region between two concentric circles of radii 2
and 3.
35, Assertion (A) : If a LPP. admits two optimal
solutions then it has infinitely many optimal
solutions.
Reason (R) : Ifthe value of the objective function of
a LPP is same at two corners then it is same at every
point on the line joining two comer points.
36. A furniture dealer deals in only two items—tables
and chairs. He took a loan of € 50,000 from the
bank to invest in this business. He took a room
‘on rent for the storage of furniture which has a
storage space of at most 60 pieces. A table costs
2500 while a chair costs € 500. He estimates that
from the sale of one table, he can make a profit of
250 and that from the sale of one chair a profit of
% 73. Find the number of tables and chairs he
should buy from the available money so as to
maximize his total profit, assuming that he can sell
all the items which he buys.
y
100
90 \
20
Alera
2
AS rey
4 \
+ |
b
ex
+ +t + x
te She OD
N ee
eeee ue
Fig
Graphical representation of optim
tion problem
Based on the above information answer the
following,
( Which constraint shows the linear objective
function using decision variables x and y?
(a) Z=250e+75y (by Z=250x-75y
(©) Z=275e-50y (d)- Z=75x-250y
Ga) Which equation shows that “he can store only
60 pieces of chairs and tables’ ?
(a) x+y260 () x-y260
(© x-y=60 (a) xtys60
(iii) Choose correct investment constraint by
furniture dealer
(a) 2500s + 500y s 50000
(b) 2500: —Sn0y < 50000
(©) 500k ~2500y 5 50000
(a) 50n2-+2500y < 50000
(1) In which case total profit would be & 6250?
[a) 10 tables and 50 chairs
(b) 50 tables and 10 chairs
(©) Stables and 55 chairs
(d) 20 tables and 40 chairs
() Due to this storage space maximum of 60 pieces,
his investment is imited toa maximum ot
(a) 755000 (by) 250000,
(58000 a) 45000 32. A cooperative society of farmers has 50 hectare of
and to grow two crops X and Y. The estimation of
income from crops per hectare is 10,500 and 9,000
respectively. To control weeds, a runny herbicide
Thas used for both eraps at rates of 20 Titres and
10litres per hectare. Additionally, no more than 800
litres of herbicide should be used for protecting
fish and natural world using a fishpond which
collect drainage from this ground,
(© hectare for crop x and 40 hedtare from copy
(@) 40 hectare for erop x and 20 hectare from
copy
38. There are three machines installed in a factory,
machines |, Il and LLL. Out of these three machines,
machines Tand II are capable of being operated for
at most 12 hours in a day whereas machine III must
bbe operated for at least 5 hours a day. In factory they
produce only two typesof toys namely, Mand Neach,
of them requires the use of all the three machines.
‘The number of hours taken by M and N on each of
the three machines are given in the table below :
tems |_Nuinber of hours required on machines
I i iM
M 1 2 1
N 2 1 1.25
The amount of profit she makes on per price of toy
Mis 600 and on toy Nis? 400.
xe + >x
O 10 20 30 Corner point | Z = 600x + 400y
Fig. : Graph of OABC is the feasible region (shaded) ot =
6%) 4000 | Maximum
ComerPoint Z= T0500" +9000 oe San
20; 0) 8 OA 1600
AO, OF 0000
FSO, 0p 550 x
CO, 50) 5000
Based on the above information answer the
following questions :
() What is the objective function of given problem ?
(a) Z=900ix + 10500y (b)Z= 10500 + 9000y
(©) Z=80Kx+10500y(a) = 10500 - 9000y
() Which equation shows the constraint related to
land?
(2) x+y250 () x-y2%0
( x+ys50 @ x-ys50
(il) Whats the characteristics of the feasible region
oaBc?
(a) Unbounded
(©) Both (a) and (b)
(b) Bounded
(a) None of these
Gv) The maximum income would be got by people
(@) 495,000 () &4,90,000
(© € 485,000 (@) © 4,80,000
(¥) How much ground should be billed to each
crops so as to maximize the total income of the
people?
(@) 30 hectare for erop x and 20 hectare from
crop y
(b) 20 hectare for crop x and 30) hectare from
crop y
Graph of ABCDE is the feasible region (shaded)
Based on the above information answer the
following:
(i How many of each type of toys should she
[produce so as to maximize her profit assuming,
that she can sell all the toys that she produed ?
What will be the maximum profit ?
(@) Aunts, €4000 —(b) 4 units, & 6000
(©) Smits, €3600__(d)_S units, €5600 (il) Select the equation of the total profit on
production
(2) Z.=600x=400y (bo) 2= 600+ 400y
(© Z= 60x» 400y (a) None of these
(i) Choose the correet constraint of Machine I:
(@) x+2y212 &) re2ys12
(© x+2y=12 (@) x42ysi2
(iv) According to above figure 1, constraint on
Machine il is
(@) 2e+2ys12(b) Oty S12
(© x+2ys22 (a) x#2ys21
() Tick on correct constraint on Machine His
5 5
a) xt 2y2. b) xy ss
(@) xe pyes © hy
3,6 a5
( xefyss — @ x4pyes
39. Corner points of the feasible region for an LPP
are (0,3), 6, 0), (6, 8), (6, 8). Let z= dx - 6y be the
objective function.
Based on the above information, answer the
following questions:
(i) The minimum value of : occurs at:
@) 68) &) 6,0)
© ©3) @ 08)
(i) Maximum value of z occurs at
@) 60) ©) ©.8)
© 3) @) 68)
(Gil) Maxez ~ min =
(@) 58 &) 68
© 78 (@) 88
Gv) The comer points of the feasible region
determined by the system of linear in equalities,
as
(@) 0,0),3,0),8,2) 23)
©) G.),6,2,2,3),.-3)
(©) 0,0), 3,0), 2,3), G2), (0,3)
(a) None of these
‘The feasible solution of LPP belongs to.
(@) First and second quadrant
(b) First and third quadrant
(©) Only second quadrant
(@) Only first quadrant
40, Linear programming is a method for finding the
optimal values (maximum orminimum) of quanties
subject to the constraints when relationshp is
expressed as linear equation or inequalities. Based
on the above information, answer the following,
questions:
(i) The optimal value of the objective function is
allainted a the points
(@ xaxis
@) onyauis
(©) which are comer points of the feasible
region
(@) none of these
(ii) The graph of the inequality 3x-+ 4y £12 is
(@) Half plane that contains the origin
(©) Half plane that neither contains the origin
ror the points one the line 3x + 4y = 12
(© Whole XOY plane excluding the points on
the line 3x + 4y =12
(@) None of these
(il The feasible region for an LPP is shown in the
figure. Let 2 = 2x + 5y be the objective function
‘maximum of z occurs at
2l8. 5)
\e 3
TT
@ 7.0) &) 63)
© 0.6) (@) 4,3)
(iv) The comer points of the feasible region.
determined by the system of linear constraints
are (0, 10), (5, 5), (15, 15}, (0, 20), Let = = px + qy,
‘where p, 4 > 0 condition on p and q so that the
maximum of z occurs at botht he points (15, 15)
and (0, 20) is
@ p=g () p=29
(© 9-27 @ 4-%
(+) The comer points of feasible region determined.
by the system of linear constraints are (0, 0),
(0, 40), (20, 40), (60, 20), (60, 0). The objective
function is z= 4x + 3y. Compare the quantity in
Column A and Column B :
Column A
MaxZ
{@) The quantity in column in A is greater
©) The quantity in column in Bis greater
(©) The two quantities are equal
{d) None oF these
Column B
305 Solutions
1.
2
9.
10.
(@ infinite
(©) half plane that neither contains the origin nor
the points of the line 2x + Sy =6
Explanation :
As the required region is not forwards the
origin.
(©) Traffic signal control
Explanation :
It does not have constraints
(0) Corner points ofthe feasible region
Explanation :
Explanation :
‘Comer point Fea oy
0.2) 2B
Go) 2
0) 4
8) n
0.5) 30
‘The minimum value of Fis 12 at (0,2) and @, 0)
c. The minimum value of F occurs at any point
‘on the line segment joining the points (0, 2) and
BO
By putting the comer points in objective 1M. (d) q=3p
function, we get the optimal value. ee
(a) Aller thesbore! It is given that the maximum value of Z occurs
Explanation : at two points (3, 4) and (0, 5). Value of Z at 3,4)
‘An optimisation problem may involve finding = Value of Z at 0,5).
maximum profit, minimum cost or minimum 0) + at) = (0) + 905), 39 +4954
use of resources ete. = Ce nee
(c)_ non-negative restrictions 12. (a) decision variables
Explanation: 13. (&) constraints
‘The conditions x > 0, and y2 0 are called non 14, (b) a function to be optimised
negative restrictions, 15. (6) Concave region
(@) 21 16. © (rin))=5
Explanation : Explanation :
“The values of Z at the corner points are given by Ix =5isnota convex set at any two points from
aan poat vaca gate postive ax of ane wl notin
@2) 7 17. (©) given by comer points of the feasible region
(0,3) 21 (Minimum) 18. (b) (0,8)
05 6 Explana
From the above table, we see that the minimum Corner Points Corresponding
value of Zs 21. value of Z=3v—4y
(@ 12 @D °
Explanation: 6.0) 15 (Maximum)
Since, the feasible region is bounded. Therefore, (6.5) =2
maximum of Z must occur atthe comers points 68) 7
ofthe feasible region
