1

Engineers Wallah (Mechanical Engineering)

Subject: Industrial Engineering & Operations Research
Chapter: Linear Programming DPP-01

1. The simplex method is the basic method for (a) Constraints / çfrca/k
flEiysDl fof/k blds fy, ewy fof/k gS (b) Objective function / mís'; lekjksg
(a) Value analysis / ewY; fo'ys"k.k (c) Decision variables / fu.kZ; pj
(b) Operation research / v‚ijs'ku vuqla/kku (d) None of the above / bues ls dksbZ Hkh ugha
(c) Linear programming / jSf[kd çksxzkfeax
(d) Method analysis / fof/k fo'ys"k.k 5. The variable that is included in the ‘’ type inequality
constraint for the purpose of converting general from
2. Linear programming is / jSf[kd çksxzkfeax gS of LPP to standard from LPP is called
(a) an abstract model, generally using mathematical
og pj tks LPP ds lkekU; dks LPP ls ekud esa ifjofrZr
symbols djus ds mís'; ls ‘’ çdkj dh vlekurk ck/kk esa 'kkfey
,d vewrZ e‚My] tks vke rkSj ij xf.krh; çrhdksa fd;k x;k gS] dgykrk gS
dk mi;ksx djrk gS (a) surplus variable / vf/k'ks"k pj
(b) is a technique, which optimizes linear objective (b) slack variable / lqLr pj
function under limited constraints (c) artificial variable / —f=e pj
,d rduhd gS] tks lhfer ck/kkvksa ds rgr jSf[kd (d) basic variable / cqfu;knh pj
mís'; QaD'ku dks vuqdwfyr djrh gS
6. Hungarian algorithm is used to solve
(c) is a technique, which ensures only integral values
gy djus ds fy, gaxsfj;u ,Yxksfjne dk mi;ksx fd;k
of variables in the problem
,d rduhd gS] tks leL;k esa dsoy pjksa ds vfHkUu tkrk gS
(a) Transportation problem
eku lqfuf'pr djrh gS
ifjogu leL;k
(d) is a technique, which is used to analyze multistage
(b) Assignment problem
decision process
vlkbuesaV dh leL;k
,d rduhd gS] ftldk mi;ksx eYVhLVst fu.kZ;
(c) Unconstraint non-linear programming problem
çfØ;k dk fo'ys"k.k djus ds fy, fd;k tkrk gS vçfrcaf/kr xSj&js[kh; çksxzkfeax leL;k
(d) Constrained non-linear programming problem
3. In transportation problem a single good is to be shipped foo'k xSj&js[kh; çksxzkfeax leL;k
from several origins to several destinations at
ifjogu leL;k esa ,d gh oLrq dks dbZ ewy LFkkuksa ls dbZ 7. The North West Corner rule
xarO;ksa rd Hkstuk gksrk gS mÙkj if'pe dksus dk fu;e
(a) Minimum overall cost / U;wure lexz ykxr (a) is used to find an initial feasible solution
(b) Optimum overall cost / b"Vre lexz ykxr çkjafHkd O;ogk;Z lek/kku [kkstus ds fy, mi;ksx
(c) Minimum price / U;wure dher fd;k tkrk gS
(d) Optimum price / b"Vre dher (b) is used to find an optimal solution
b"Vre lek/kku [kkstus ds fy, mi;ksx fd;k tkrk gS
4. In an linear programming problem, the restrictions or (c) is based on the concept of minimizintg
limitations under which the objective function is to be opportunity cost
optimized are called volj ykxr dks U;wure djus dh vo/kkj.kk ij
,d jSf[kd çksxzkfeax leL;k es]a mu çfrca/kksa ;k lhekvksa vk/kkfjr gS
dks dgk tkrk gS ftuds rgr mís'; QaD'ku dks vuqdwfyr (d) none of the above
fd;k tkuk gS bues ls dksbZ Hkh ugha
 2

8. The Linear Programming with ______ variables can be fcx&,e&fof/k dk mi;ksx djds ,d jSf[kd çksxzkfeax
solved graphically leL;k dh lek/kku çfØ;k es]a tc ,d —f=e pj
______ osfj,cYl ds lkFk jSf[kd çksxzkfeax dks xzkfQd vk/kkj NksM+ nsrk gS] rks —f=e pj ds d‚ye dks ckn
:i ls gy fd;k tk ldrk gS dh lHkh rkfydkvksa ls gVk;k tk ldrk gSA
(a) two / nks (b) three / rhu Of above, which are correct?
(c) four / pkj (d) five / ik¡p mijksä esa ls dkSu lk lgh gS\
(a) 1 (b) 1, 3
9. An objective function is p (x, y) = 3x + 9y and (c) 1, 2, 3 (d) 2, 3
constraints are
,d oLrqfu"B Qyu p (x, y) = 3x + 9y gS vkSj ck/kk,¡ gSa 12. When there are ‘m’ rows and ‘n’ columns in a
x + y  8, transportation problem, degeneracy is said to occur
x + 2y  4, when the number of allocations is
x  0, tc ifjogu leL;k esa ‘m’ iafä;k¡ vkSj ‘n’ d‚ye gksrs gSa]
y  0, rks vkoaVu dh la[;k gksus ij fo—fr mRiUu gksrh gSA
The maximum value of objective function is (a) Less than (m + n – 1) / (m + n – 1) ls de
oLrqfu"B Qyu dk vf/kdre eku gS (b) Greater than (m + n – 1) / (m + n – 1) ls cM+k
(a) 18 (b) 24
(c) Equal to (m – n – 1) / (m – n – 1) ds cjkcj
(c) 30 (d) 12
(d) Less than (m – n – 1) / (m – n – 1) ls de
10. Which one of the following is not the solution method
of transportation problems? 13. In a transportation problem, the materials are
fuEufyf[kr esa ls dkSu lh ifjogu leL;kvksa dk lek/kku transported from 3 plants to 5 warehouses, the basis
fof/k ugha gS\ feasible solution must contain exactly, which one of
the following allocated cells?
(a) Hungarian method / gaxsfj;u i)fr
,d ifjogu leL;k esa] lkexzh dks 3 la;a=ksa ls 5 xksnkeksa
(b) Northwest corner method / ok;O; dks.k fof/k
(c) Least cost method / de ls de ykxr okyh fof/k
rd igqapk;k tkrk gS] vk/kkj O;ogk;Z lek/kku esa
(d) Vogel’s approximation method
fuEufyf[kr esa ls dkSu lk vkoafVr lsy gksuk pkfg,\
oksxsy dh lfUudVu fof/k (a) 3 (b) 5
(c) 7 (d) 8
11. Consider the following statements:
fuEufyf[kr dFkuksa ij fopkj djsa% 14. The maximum value of Z = 3x + 4y subjected to the
1. A linear programming problem with three constraints 2x + y  4, x + 24  12, x  0, y  0
variables and two constraints can be solved by Z dk vf/kdre eku = 3x + 4y gS tks vojks/kksa 2x + y 
graphical method. 4, x + 24  12, x  0, y  0 ds v/khu gSA
rhu pj vkSj nks ck/kkvksa okyh ,d jSf[kd çksxzkfeax (a) 10
leL;k dks xzkfQdy fof/k }kjk gy fd;k tk ldrk (b) 20
gSA (c) 30
2. For solutions of a linear programming problem (d) No feasible solution / dksbZ O;ogk;Z lek/kku ugha
with mixed constraints. Big-M-method can be
employed. 15. In a transportation problem with 4 supply points and 5
fefJr ck/kkvksa okyh jSf[kd çksxzkfeax leL;k ds demand points, how many number of constraints are
lek/kku ds fy,A fcx&,e&fof/k dks fu;ksftr fd;k required in its formulation?
tk ldrk gSA 4 vkiwfrZ fcanqvksa vkSj 5 ekax fcanqvksa okyh ,d ifjogu
3. In the solution process of a linear programming leL;k esa] blds fuekZ.k esa fdruh ck/kkvksa dh vko';drk
problem using Big-M-method, when an artificial gksrh gS\
variable leaves the basis, the column of the (a) 20 (b) 1
artificial variable can be removed from all (c) 0 (d) 9
subsequent tables.
 3

16. In a 6 × 6 transportation problem, degeneracy would ifjogu leL;k dk O;ogk;Z lek/kku dsoy rHkh gksxk tc
arise, if the number of filled slots were m n

6 × 6 ifjogu leL;k esa] ;fn Hkjs gq, Ly‚Vksa dh la[;k (a)  Si =  d j

i =1 j=1
gksrh] rks v/k:iru mRiUu gksrk m n
(a) Equal to thirty six / NÙkhl ds cjkcj (b)  Si   d j
(b) More than twelve / ckjg ls vf/kd i =1 j=1

(c) Equal to twelve / ckjg ds cjkcj m n

(d) Less than eleven / X;kjg ls Hkh de

(c)  Si   d j
i =1 j=1

(d) None of the above / bues ls dksbZ Hkh ugha

17. A transportation problem will have feasible solutions
if and only if
❑ ❑ ❑
 4

Answer Key
1. (c) 10. (a)
2. (b) 11. (d)
3. (a) 12. (a)
4. (a) 13. (c)
5. (b) 14. (d)
6. (b) 15. (d)
7. (a) 16. (d)
8. (a) 17. (a)
9. (a)
❑ ❑ ❑

Any issue with DPP, please report by clicking here:- https://forms.gle/t2SzQVvQcs638c4r5

For more questions, kindly visit the library section: Link for web: https://smart.link/sdfez8ejd80if

PW Mobile APP: https://smart.link/7wwosivoicgd4