Professional Documents
Culture Documents
Objective Type IV SEM - OPERATIONS RESEARCH PDF
Objective Type IV SEM - OPERATIONS RESEARCH PDF
BCA
IVSem
OPERATIONSRESEARCH
1. OperationsResearch(OR),whichisaverypowerfultoolfor
a) Research
b) DecisionMaking
c) Operations
d) Noneoftheabove
2. WhocoinedthetermOperationsResearch?
a) J.F.McCloskey
b) F.N.Trefethen
c) P.F.Adams
d) BothAandB
3. ThetermOperationsResearchwascoinedintheyear
a) 1950
b) 1940
c) 1978
d) 1960
4. ThisinnovativescienceofOperationsResearchwasdiscoveredduring
a) CivilWar
b) WorldWarI
c) WorldWarII
d) IndustrialRevolution
5. OperationsResearchwasknownasanabilitytowinawarwithoutreallygoingintoa
a) Battlefield
b) Fighting
c) War
d) BothAandB
6. WhodefinedOperationsResearchasscientificmethodofprovidingexecutivedepartmentswith
aquantitativebasisfordecisionsregardingtheoperationsundertheircontrol?
a) MorseandKimball(1946)
b) P.M.S.Blackett(1948)
c) E.L.ArnoffandM.J.Netzorg
d) Noneoftheabove
7. WhodefinedOperationsResearchasscientificapproachtoproblemsolvingforexecutive
management?
a) E.L.Arnoff
b) P.M.S.Blackett
c) H.M.Wagner
d) Noneoftheabove
8. WhodefinedOperationsResearchasanaidfortheexecutiveinmarketinghisdecisionsby
providinghimwiththequantitativeinformationbasedonthescientificmethodofanalysis?
a) C.Kitte
b) H.M.Wagner
c) E.L.Arnoff
d) Noneoftheabove
9. OperationsResearchhasthecharacteristicstheitisdonebyateamof
a) Scientists
b) Mathematicians
c) Academics
d) Alloftheabove
10. Thereisagreatscopeforworkingasateamtosolveproblemsofdefencebyusingthe
OperationsResearchapproach
a) Economists
b) Administrators
c) StatisticiansandTechnicians
d) Alloftheabove
11. OperationsResearchemphasizesontheoverallapproachtothesystem.Thischarecteristicsof
OperationsResearchisoftenreferredas
a) SystemOrientation
b) SystemApproach
c) InterdisciplinaryTeamApproach
12. OperationsResearchcannotgiveperfecttoproblems
a) Answers
b) Solutions
c) BothAandB
d) Decisions
13. OperationsResearchsimplyhelpsinimprovingtheofthesolutionbutdoesnotresult
inaperfectsolution.
a) Quality
b) Clarity
c) Look
d) Noneoftheabove
14. OperationsResearchinvolvesattackofcomplexproblemstoarriveatthe
optimumsolution
a) Scientific
b) Systematic
c) BothAandB
d) Statistical
15. OperationsResearchusesmodelsbuiltbyquantitativemeasurementofthevariablesconcerning
agivenproblemandalsoderivesasolutionfromthemodelusingofthediversified
solutiontechniques
a) Twoormore
b) Oneormore
c) Threeormore
d) OnlyOne
16. Asolutionmaybeextractedfromamodeleitherby
a) Conductingexperimentsonit
b) Mathematicalanalysis
c) BothAandB
d) DiversifiedTechniques
17. OperationsResearchusesmodelstohelpthemanagementtodetermineits
scientifically
a) Policies
b) Actions
c) BothAandB
d) Noneoftheabove
18. OperationsResearchisa
a) Science
b) Art
c) Mathematics
d) BothAandB
19. WhathavebeenconstructedforOperationsResearchproblemsandmethodsforsolvingthe
modelsthatareavailableinmanycases?
a) ScientificModels
b) Algorithms
c) MathematicalModels
d) Noneoftheabove
20. Whichtechniqueisusedinfindingasolutionforoptimizingagivenobjective,suchasprofit
maximizationorcostminimizationundercertainconstraints?
a) QuailingTheory
b) WaitingLine
c) BothAandB
d) LinearProgramming
21. Whataimsatoptimizinginventorylevels?
a) InventoryControl
b) InventoryCapacity
c) InventoryPlanning
d) Noneoftheabove
22. Whatcanbedefinedasausefulidleresourcewhichhaseconomicvalueeg;rawmaterials,spare
parts,finisheditems,etc?
a) InventoryControl
b) Inventory
c) InventoryPlanning
d) Noneoftheabove
23. Whichtheoryconcernsmakingsounddecisionsunderconditionsofcertainity,riskand
uncertainty
a) GameTheory
b) NetworkAnalysis
c) DecisionTheory
d) Noneoftheabove
24. Keyconceptunderwhichtechniquearenetworkofeventsandactivities,resourceallocation,
timeandcostconsiderations,networkpathsandcriticalpaths?
a) GameTheory
b) NetworkAnalysis
c) DecisionTheory
d) Noneoftheabove
25. Whichtechniqueisusedtoimitateanoperationpriortoactualperformance?
a) Simulation
b) IntegratedProductionModels
c) InventoryControl
d) GameTheory
26. Whatisconcernedwiththepredictionofreplacementcostsanddeterminationofthemost
economicreplacementpolicy?
a) SearchTheory
b) Theoryofreplacement
c) ProbabilisticProgramming
d) Noneoftheabove
27. WhatreferstoLinearProgrammingthatincludesanevaluationofrelativerisksand
uncertaintiesinvariousalternativesofchoiceformanagementdecisions?
a) ProbabilisticProgramming
b) StochasticProgramming
c) BothAandB
d) LinearProgramming
28. Whatenablesustodeterminetheearliestandthelatesttimesforeachoftheeventsand
activitiesandtherebyhelpsintheidentificationofthecriticalpath?
a) ProgrammeEvaluation
b) ReviewTechnique(PERT)
c) BothAandB
d) Deploymentofresources
29. LinearProgrammingtechniqueisusedtoallocatescarceresourcesinanoptimummannerin
problemsof?
a) Schedule
b) ProductMix
c) BothAandB
d) ServicingCost
30. OperationsResearchtechniqueshelpsthedirectingauthorityinoptimumallocationofvarious
limitedresources,suchas
a) MenandMachine
b) Money
c) MaterialandTime
d) Alloftheabove
31. OperationsResearchstudygenerallyinvolveshowmanyphases?
a) Three
b) Four
c) Five
d) Two
32. modelsinvolvestheallocationofresourcestoactivitiesinsuchamannerthatsome
measureofeffectivenessisoptimized.
a) Sequencing
b) AllocationModels
c) QueuingTheory
d) DecisionTheory
33. Allocationproblemscanbesolvedby
a) LinearProgrammingTechnique
b) NonLinearProgrammingTechnique
c) BothAandB
d) Noneoftheabove
34. Inmodels,everythingisdefinedandtheresultsarecertain,
a) DeterministicModels
b) ProbabilisticModels
c) BothAandB
d) Noneoftheabove
35. Inmodelsthereisriskanduncertainty
a) DeterministicModels
b) ProbabilisticModels
c) BothAandB
d) Noneoftheabove
36. modelsareobtainedbyenlargingorreducingthesizeoftheitem
a) IconicModels
b) AnalogueModels
c) SymbolicModels
d) Noneoftheabove
37. OperationsResearchattemptstofindthebestandsolutiontoaproblem
a) Optimum
b) Perfect
c) Degenerate
d) Noneoftheabove
38. Thewordmaybedefinedassomeactionthatweapplytosomeproblemsor
hypothesis.
a) Research
b) Operation
c) BothAandB
d) Noneoftheabove
39. TheoperationsResearchtechnique,speciallyusedtodeterminetheoptimumstrategyis
a) DecisionTheory
b) Simulation
c) GameTheory
d) Noneoftheabove
40. TheoperationsResearchtechniquewhichhelpsinminimizingtotalwaitingandservicecostsis
a) QueuingTheory
b) DecisionTheory
c) BothAandB
d) Noneoftheabove
41. aretherepresentationofreality
a) Models
b) Phases
c) BothAandB
d) Noneoftheabove
42. arecalledmathematicalmodels
a) IconicModels
b) AnalogueModels
c) SymbolicModels
d) Noneoftheabove
43. Itisnoteasytomakeanymodificationorimprovementin
a) IconicModels
b) AnalogueModels
c) SymbolicModels
d) Noneoftheabove
44. Inmodelsonesetofpropertiesisusedtorepresentanothersetofproperties
a) IconicModels
b) AnalogueModels
c) SymbolicModels
d) Noneoftheabove
45. AllocationModelsare
a) Iconicmodels
b) AnalogueModels
c) SymbolicModels
d) Noneoftheabove
46. Probabilisticmodelsarealsoknownas
a) DeterministicModels
b) StochasticModels
c) DynamicModels
d) StaticModels
47. modelsassumesthatthevaluesofthevariablesdonotchangewithtimeduringa
particularperiod
a) StaticModels
b) DynamicModels
c) BothAandB
d) Noneoftheabove
48. Amodelsconsiderstimeasoneoftheimportantvariable
a) StaticModels
b) DynamicModels
c) BothAandB
d) Noneoftheabove
49. ReplacementModelisamodel
a) StaticModels
b) DynamicModels
c) BothAandB
d) Noneoftheabove
50. maybedefinedasamethodofdetermininganoptimumprogrammeinter
dependentactivitiesinviewofavailableresources
a) GoalProgramming
b) LinearProgramming
c) DecisionMaking
d) Noneoftheabove
51. areexpressedisntheformofinequitiesorequations
a) Constraints
b) ObjectiveFunctions
c) BothAandB
d) Noneoftheabove
52. Theobjectivefunctionsandconstraintsarelinearrelationshipbetween
a) Variables
b) Constraints
c) Functions
d) Alloftheabove
53. Assignmentproblemhelpstofindamaximumweightidenticalinnatureinaweighted
a) Tripartitegraph
b) Bipartitegraph
c) Partitegraph
d) Noneoftheabove
54. Alltheparametersinthelinearprogrammingmodelareassumedtobe
a) Variables
b) Constraints
c) Functions
d) Noneoftheabove
55. Thesolutionneednotbeinnumbers
a) PrimeNumber
b) WholeNumber
c) ComplexNumber
d) Noneoftheabove
56. GraphicmethodcanbeappliedtosolveaLPPwhenthereareonlyvariable
a) One
b) MorethanOne
c) Two
d) Three
57. IfthefeasibleregionofaLPPisempty,thesolutionis
a) Infeasible
b) Unbounded
c) Alternative
d) Noneoftheabove
58. Thevariableswhosecoefficientvectorsareunitvectorsarecalled
a) UnitVariables
b) BasicVariables
c) NonbasicVariables
d) Noneoftheabove
59. Anycolumnorrawofasimplextableiscalleda
a) Vector
b) Keycolumn
c) KeyRaw
d) Noneoftheabove
60. Iftherearemoriginalvariablesandnintroducedvariables,thentherewillbe
columnsinthesimplextable
a) M+n
b) Mn
c) 3+m+n
d) M+n1
61. Aminimizationproblemcanbeconvertedintoamaximizationproblembychangingthesignof
coefficientsinthe
a) Constraints
b) ObjectiveFunctions
c) BothAandB
d) Noneoftheabove
62. IfinaLPP,thesolutionofavariablecanbemadeinfinitylargewithoutviolatingtheconstraints,
thesolutionis
a) Infeasible
b) Unbounded
c) Alternative
d) Noneoftheabove
63. Inmaximizationcases,areassignedtotheartificialvariablesastheircoefficientsin
theobjectivefunction
a) +m
b) m
c) 0
d) Noneoftheabove
64. Insimplexmethod,weaddvariablesinthecaseof=
a) SlackVariable
b) SurplusVariable
c) ArtificialVariable
d) Noneoftheabove
65. Insimplexmethod,ifthereistiebetweenadecisionvariableandaslack(orsurplus)variable,
shouldbeselected
a) Slackvariable
b) Surplusvariable
c) Decisionvariable
d) Noneoftheabove
66. ABFSofaLPPissaidtobeifatleastoneofthebasicvariableiszero
a) Degenerate
b) Nondegenerate
c) Infeasible
d) Unbounded
67. InLPP,degeneracyoccursinstages
a) One
b) Two
c) Three
d) Four
68. EveryLPPisassociatedwithanotherLPPiscalled
a) Primal
b) Dual
c) Nonlinearprogramming
d) Noneoftheabove
69. Asformaximizationinassignmentproblem,theobjectiveistomaximizethe
a) Profit
b) optimization
c) cost
d) Noneoftheabove
70. Iftherearemorethanoneoptimumsolutionforthedecisionvariablethesolutionis
a) Infeasible
b) Unbounded
c) Alternative
d) Noneoftheabove
71. Dualofthedualis
a) Primal
b) Dual
c) Alternative
d) Noneoftheabove
72. OperationsResearchapproachis
a) Multidisciplinary
b) Scientific
c) Initiative
d) Alloftheabove
73. Foranalyzingtheproblem,decisionmakersshouldnormallystudy
a) Itsqualitativeaspects
b) Itsquantitativeaspects
c) BothAandB
d) NeitherAandB
74. Decisionvariablesare
a) Controllable
b) Uncontrollable
c) Parameters
d) Noneoftheabove
75. Theissueofdecisionmodels
a) Ispossiblewhenthevariablesvalueis
b) Reducesthescopeofjudgmentandintuitionknownwithcertaintyindecisionmaking
c) Requirestheknowledgeofcomputersoftwareuse
d) Noneoftheabove
76. isoneofthefundamentalcombinatorialoptimizationproblems.
a) Assignmentproblem
b) Transportationproblem
c) OptimizationProblem
d) Noneoftheabove
77. Anoptimizationmodel
a) Mathematicallyprovidesthebestdecision
b) Providesdecisionwithinitslimitedcontext
c) Helpsinevaluatingvariousalternativesconstantly
d) Alloftheabove
78. Thequantitativeapproachtodecisionanalysisisa
a) Logicalapproach
b) Rationalapproach
c) Scientificapproach
d) Alloftheabove
79. OperationsResearchapproachistypicallybasedontheuseof
a) Physicalmodel
b) Mathematicalmodel
c) Iconicmodel
d) Descriptivemodel
80. Inamanufacturingprocess,whotakesthedecisionsastowhatquantitiesandwhichprocessor
processesaretobeusedsothatthecostisminimumandprofitismaximum?
a) Supervisor
b) Manufacturer
c) Producer
d) Productionmanager
81. Linearprogramminghasbeensuccessfullyappliedin
a) Agricultural
b) Industrialapplications
c) BothAandB
d) Manufacturing
82. Thetermlinearityimpliesamongtherelevantvariables:
a) Straightline
b) Proportionalrelationships
c) Linearlines
d) BothAandB
83. Processreferstothecombinationofinputstoproduceaparticularoutput.
a) oneormore
b) twoormore
c) one
d) Noneoftheabove
84. Whathasalwaysbeenveryimportantinthebusinessandindustrialworld,particularlywith
regardtoproblemsconcerningproductionsofcommodities?
a) LinearProgramming
b) Production
c) Decisionmaking
d) Noneoftheabove
85. Whatarethemainquestionsbeforeaproductionmanager?
a) Whichcommodity/commoditiestoproduce
b) Inwhatquantities
c) Bywhichprocessorprocesses
d) Alloftheabove
86. Whopointedoutthatthebusinessmanalwaysstudieshisproductionfunctionandhisinput
pricesandsubstitutesoneinputforanothertillhiscostsbecometheminimumpossible?
a) AlanMarshall
b) AlfredMarsh
c) AlfredMarshall
d) Noneoftheabove
87. Whoinventedamethodofformalcalculationsoftentermedas?
a) A.V.Kantorovich
b) L.V.Kantorovich
c) T.S.Kantorovich
d) AlfredMarshall
88. WhodevelopedLinearProgrammingforthepurposeofschedulingthecomplicated
procurementactivitiesoftheUnitedStatesAirForce?
a) GeorgeB.Dantzig
b) JamesB.Dantzig
c) GeorgeB.Dante
d) GeorgeV.Dantzig
89. ThismethodofformalcalculationsoftentermedasLinearProgrammingwasdevelopedlaterin
whichyear?
a) 1947
b) 1988
c) 1957
d) 1944
90. Whatisbeingconsideredasoneofthemostversatilemanagementtools?
a) ElectronicComputers
b) LinearProgramming
c) ComputerProgramming
d) Noneoftheabove
91. LPisamajorinnovationsinceinthefieldofbusinessdecisionmaking,particularly
underconditionsofcertainty.
a) IndustrialRevolution
b) WorldWarI
c) WorldWarII
d) FrenchRevolution
92. TheworldLinearmeansthattherelationshipsarerepresentedby
a) Diagonallines
b) Curvedlines
c) Straightlines
d) Slantinglines
93. Theworldprogrammingmeanstakingdecisions
a) Systematically
b) Rapidly
c) Slowly
d) Instantly
94. WhooriginallycalleditProgrammingofinterdependentactivitiesinalinearstructurebutlater
shortenedittoLinearProgramming?
a) Dantzig
b) Kantorovich
c) Marshall
d) Noneoftheabove
95. LPcanbeappliedinfarmmanagementproblemsisrelatestotheallocationofresourcessuchas
,insuchawaythatismaximizesnetrevenue
a) Acreage
b) Labour
c) Watersupplyorworkingcapital
d) Alloftheabove
96. LPmodelisbasedontheassumptionsof
a) Proportionality
b) Additivity
c) Certainty
d) Alloftheabove
97. assumptionmeansthepriorknowledgeofallthecoefficientsintheobjective
function,thecoefficientsoftheconstraintsandtheresourcevalues.
a) Proportionality
b) Certainty
c) Finitechoices
d) Continuity
98. Simplelinearprogrammingproblemwithvariablescanbeeasilysolvedbythe
graphicalmethod.
a) Onedecision
b) Fourdecisions
c) Threedecisions
d) Twodecisions
99. AnysolutiontoaLPPwhichsatisfiesthenonnegativityrestrictionsoftheLPPiscalledits
a) Unboundedsolution
b) Optimalsolution
c) Feasiblesolution
d) BothAandB
100. Anyfeasiblesolutionwhichoptimizes(minimizesormaximizes)theobjectivefunctionofthe
LPPiscalledits
a) Optimalsolution
b) Nonbasicvariables
c) Solution
d) Basicfeasiblesolution
101. Anondegeneratebasicfeasiblesolutionisthebasicfeasiblesolutionwhichhasexactlym
positiveXi(i=1,2,,m),i.e.,noneofthebasicvariableis
a) Infinity
b) One
c) Zero
d) X
102. WhatisalsodefinedasthenonnegativevariableswhichareaddedintheLHSoftheconstraint
toconverttheinequality<intoanequation?
a) Slackvariables
b) Simplexalgorithm
c) Keyelement
d) Noneoftheabove
103. WhichmethodisaniterativeprocedureforsolvingLPPinafinitenumberofsteps?
a) Simplexalgorithm
b) Slackvariable
c) Mmethod
d) Simplexmethod
104. Insimplexalgorithm,whichmethodisusedtodealwiththesituationwhereaninfeasible
startingbasicsolutionisgiven?
a) Slackvariable
b) Simplexmethod
c) Mmethod
d) Noneoftheabove
105. HowmanymethodsaretheretosolveLPP?
a) Three
b) Two
c) Four
d) Noneoftheabove
106. isanothermethodtosolveagivenLPPinvolvingsomeartificialvariable?
a) BigMmethod
b) Methodofpenalties
c) Twophasesimplexmethod
d) Noneoftheabove
107. Whichvariablesarefictitiousandcannothaveanyphysicalmeaning?
a) Optimalvariable
b) Decisionvariable
c) Artificialvariable
d) Noneoftheabove
108. Anobjectivefunctionwhichstatesthedeterminantsofthequantitytobeeithermaximizedor
minimizediscalled
a) Feasiblefunction
b) Optimalfunction
c) Criterionfunction
d) Noneoftheabove
109. Anassumptionthatimpliesthatfinitenumbersofchoicesareavailabletoadecisionmaker
andthedecisionvariablesdonotassumenegativevaluesisknownas
a) Certainty
b) Continuity
c) Finitechoices
d) Noneoftheabove
110. AsetofvaluesX1,X2,XnwhichsatisfiestheconstraintsoftheLPPiscalled
a) Solution
b) Variable
c) Linearity
d) Noneoftheabove
111. Abasicsolutionwhichalsosatisfiestheconditioninwhichallbasicvariablesarenonnegative
iscalled
a) Basicfeasiblesolution
b) Feasiblesolution
c) Optimalsolution
d) Noneoftheabove
112. Alltheconstraintsareexpressedasequationsandtherighthandsideofeachconstraintandall
variablesarenonnegativeiscalled
a) Canonicalvariable
b) Canonicalform
c) Canonicalsolution
d) BothAandB
113. Anobjectivefunctionismaximizedwhenitisafunction
a) Passive
b) Profit
c) Cost
d) Noneoftheabove
114. LPPisexactlyusedinsolvingwhatkindofresourceallocationproblems?
a) Productionplanningandscheduling
b) Transportation
c) Salesandadvertising
d) Alloftheabove
115. Currently,LPPisusedinsolvingawiderangeofpractical
a) Businessproblems
b) Agriculturalproblems
c) Manufacturingproblems
d) Noneoftheabove
116. referstothecombinationofoneormoreinputstoproduceaparticularoutput.
a) Solution
b) variable
c) Process
d) Noneoftheabove
117. Anoptimumsolutionisconsideredtheamongfeasiblesolutions.
a) Worst
b) Best
c) Ineffective
d) Noneoftheabove
118. Pleasestatewhichstatementistrue.
(i) Alllinearprogrammingproblemsmaynothaveuniquesolutions
(ii) Theartificialvariabletechniqueisnotadevicethatdoesnotgetthestartingbasicfeasible
solution.
a) Both(i)and(ii)
b) (ii)only
c) (i)only
d) Bothareincorrect
119. Pleasestatewhichstatementisincorrect.
(i) LinearprogrammingwasfirstformulatedbyanEnglisheconomistL.V.Kantorovich
(ii) LPisgenerallyusedinsolvingmaximizationorminimizationproblemssubjecttocertain
assumptions.
a) (ii)only
b) (i)only
c) Both(i)and(ii)
d) Botharecorrect
120. whichisasubclassofalinearprogrammingproblem(LPP)
a) Programmingproblem
b) Transportationproblem
c) Computerproblem
d) Bothareincorrect
121. Thesolutionofanytransportationproblemisobtainedinhowmanystages?
a) Five
b) Four
c) Three
d) Two
122. Anoptimalsolutionisthestageofasolutionobtainedbyimprovingtheinitialsolution
a) Third
b) First
c) Second
d) Final
123. MODImethodisusedtoobtain
a) Optimalsolutions
b) Optimalitytest
c) BothAandB
d) Optimization
124. Forsolvinganassignmentproblem,whichmethodisused?
a) Hungarian
b) American
c) German
d) Bothareincorrect
125. Tomakeanunbalancedassignmentproblembalanced,whatareaddedwithallentriesas
zeroes?
a) Dummyrows
b) Dummycolumns
c) BothAandB
d) Dummyentries
126. Anysetofnonnegativeallocations(Xij>0)whichsatisfiestherawandcolumnsum(rim
requirement)iscalleda
a) Linearprogramming
b) Basicfeasiblesolution
c) Feasiblesolution
d) Noneoftheabove
127. Afeasiblesolutioniscalledabasicfeasiblesolutionifthenumberofnonnegativeallocationsis
equalto
a) mn+1
b) mn1
c) m+n1
d) Noneoftheabove
128. Anyfeasiblesolutiontoatransportationproblemcontainingmoriginsandndestinationsis
saidtobe
a) Independent
b) Degenerate
c) Nondegenerate
d) BothAandB
129. Apathformedbyallowinghorizontalandverticallinesandtheentirecornercellsofwhichare
occupiediscalleda
a) Occupiedpath
b) Openpath
c) Closedpath
d) Noneoftheabove
130. Transportationalgorithmcanbeusedforminimizingthetransportationcostoffrom
OoriginsandDdestinations
a) Goods
b) Products
c) Items
d) Noneoftheabove
131. Ifdemandislesserthansupplythendummydemandnodeisaddedtomakeita
a) Simpleproblem
b) Balancedproblem
c) Transportationproblem
d) Noneoftheabove
132. Basiccellsindicatepositivevaluesandnonbasiccellshavevalueforflow
a) Negative
b) Positive
c) One
d) zero
133. Accordingtotransportationproblemnumberofbasiccellswillbeexactly
a) m+n0
b) n+m1
c) m+n1
d) Noneoftheabove
134. Beforestartingtosolvetheproblem,itshouldbebalanced.Ifnotthenmakeitbalancedby
columnincasedemandislessthansupplyorbyaddingrawincasesupplyisless
thanthedemand
a) O,D
b) m,n
c) Horizontal,Vertical
d) Unshippedsupply,Shortage
135. Inwhichphaseisoptimizationdoneandhowdoesthatphasealsochecksforoptimality
conditions?
a) PhaseII
b) PhaseI
c) PhaseII
d) Noneoftheabove
136. Optimalityconditionsareexpressedasincaseallnonbasiccells?
a) Negligentcosts
b) Advancedcosts
c) Reducedcosts
d) Noneoftheabove
137. Ahasrows/columnhavingnonbasiccellsforholdingcompensating(+)or()sign.
a) Cycle
b) Deadend
c) Backtrack
d) Noneoftheabove
138. Afterdeterminingeverybasiccellwithinthiscycle,adjustmentisobtainedasminimumvalue
inbasiccells.thisisknownas
a) Adjustmentamount
b) aa
c) BothAandB
d) Alternatives
139. Optimalsolutionisafeasiblesolution(notnecessarilybasic)whichminimizesthe
a) Timetaken
b) Partialcost
c) Totalcost
d) Noneoftheabove
140. Statewhichofthetwostatementsiscorrect
(i) thecellsinthetransportationtablecanbeclassifiedintooccupiedcellsandunoccupied
cells
(ii) optimalsolutionisafeasiblesolution(notnecessarilybasic)whichmaximizesthetotalcost
a) both(i)and(ii)arecorrect
b) Twoonly
c) Oneonly
d) Both(i)and(ii)areincorrect
141. Theallocatedcellsinthetransportationtablearecalled
a) Occupiedcells
b) Emptycells
c) BothAandB
d) Unoccupiedcells
142. VAMstandsfor
a) VogealsApproximationMethod
b) VogelsApproximateMethod
c) VangelsApproximationMethod
d) VogelsApproximationMethod
143. Oncetheinitialbasicfeasiblesolutionhasbeencomputed,whatisthenextstepinthe
problem
a) VAM
b) Modifieddistributionmethod
c) Optimalitytest
d) Noneoftheabove
144. Onecanfindtheinitialbasicfeasiblesolutionbyusing?
a) VAM
b) MODI
c) Optimalitytest
d) Noneoftheabove
145. Whatdoweapplyinordertodeterminetheoptimumsolution?
a) LPP
b) VAM
c) MODIMethod
d) Noneoftheabove
146. InaTP,ifthenumberofnonnegativeindependentallocationisthanm+n1.
a) Equivalent
b) Greater
c) Less
d) Noneoftheabove
147. AgivenTPissaidtobeunbalanced,ifthetotalsupplyisnotequaltothetotal
a) Optimization
b) Demand
c) Cost
d) Noneoftheabove
148. Ifthetotalsupplyislessthanthetotaldemand,adummysource(row)isincludedinthecost
matrixwith
a) DummyDemand
b) DummySupply
c) ZeroCost
d) BothAandB
149. Tofindtheoptimalsolution,weapply
a) LPP
b) VAM
c) MODIMethod
d) Rim
150. FormaximizationinTP,theobjectiveistomaximizethetotal
a) Solution
b) ProfitMatrix
c) Profit
d) Noneoftheabove
ANSWERS
1. b 2.d 3.b 4.c 5.d 6.a 7.c 8.a 9.a 10.d 11.d 12.c
13. a 14.c 15.b 16.c 17.c 18.d 19.c 20.d 21.c 22.b 23.c 24.b
25. a 26.b 27.c 28.c 29.c 30.d 31.a 32.b 33.c 34.a 35.b 36.a
37.a 38.b 39.b 40.a 41.a 42.c 43.c 44.a 45.c 46.b 47.a 48.b
49. b 50.b 51.a 52.a 53.b 54.b 55.b 56.c 57.a 58.b 59.a
60. 61.b 62.b 63.a 64.c 65.c 66.a 67.b 68.b 69.a 70.c 71.a
72. c 73.a 74.d 75.d 76.a 77.d 78.c 79.b 80.d 81.c 82.d 83.a
84. c 85.d 86.c 87.d 88.a 89.a 90.b 91.c 92.c 93.a 94.a 95.d
96.d 97.b 98.d 99.c 100.a 101.c 102.a 103.d 104.c 105.b 106.c 107.c
108.c 109.c 110.a 111.a 112.b 113.b 114.d 115.a 116.c 117.b 118.c 119.b
120.b 121.d 122.c 123.c 124.a 125.c 126.c 127.c 128.c 129.c 130.a 131.b
132.d 133.c 134.d 135.c 136.c 137.a 138.c 139.c 140.c 141.c 142.d 143.c
144.a 145.c 146.c 147.b 148.c 149.c 150.c