Linear Programming Quiz

Welcome to QT QuizPlease switch off your mobile phones or keep it in silent mode.

Please close all your books, copies and laptops before we proceed with the quiz.

Rules of the gameThere are 6 rounds and a group gets 2 questions in each round.

Every correct answer carries 2 marks.

The time allowed for every question is 50 seconds.

Any queries will be entertained only after the quiz is over.There is a bonus round in the end which may be held depending on availability of time. The rules will be disclosed at that point of time only.

Question 1.The method in which we find the corner points of the feasible region graphically and then compute the profit at each of these points to find the optimal solution is called as _____________ ? Iso-profit line methodAEnd-point methodBCorner point methodCEdge solution methodD

Question 2.A measurable input quantity that is inherent in the problem is known as __________ ? AssumptionAModelBConstraintCParameterD

Question 3.A transportation problem can be solved by :Simplex method Transportation method iii. Multiple optimal method ii. onlyAi. & ii. onlyBii. & iii. onlyCAll of the aboveD

Question 4.A LPP has a bounded feasible region. If this problem has an equality(=) constraint then This must be a minimization problemAThe feasible region must consist of a line segmentBThe problem must be degenerateCThe problem must have more then one optimal solutionD

Question 5.If a particular constraint doesn’t affect the feasible region, then it is called as a __________ ? Redundant constraintAZero-value constraintBDummy constraintCIt cannot be considered as a constraintD

Question 6.Which of the following are the methods used for solving Operations Research models ? Analytical proceduresAIterative proceduresBMonte-Carlo TechniquesCAll of theseD

Question 7.In a transportation problem every loop has _______ ? Even number of cellsAOdd number of cellsBEither even or odd number of cellsCInadequate dataD

Question 8.Estimating election results before actually the counting is completed represents which kind of model ? Iconic modelADynamic modelBPredictive modelCPrescriptive modelD

Question 1.In which of the following situations Operations Research can be used ? Transportation loading and unloadingACash flow planningBBoth of theseCNone of theseD

Question 2.In LP, variables do not have to be integer valued and may take on any fractional value. This assumption is called __________ ? ProportionalityADivisibilityBAdditivityCCertaintyD

Question 3.Which of the following is a physical model in Operations Research Methodology ? Analogue modelASymbolic modelBDeterministic modelCProbabilistic modelD

Question 4.Having more than 1 optimal solution __________ .Provide management with greater flexibility in using resourcesACreate confusion as in which solution to selectBDoesn’t affect at allCBoth A & BD

Question 5.Which model came into existence due to difficulty in representing more than three variables graphically? ? AnalogueAIconic BSymbolicCPhysicalD

Question 6.Which of this is not a phase of operation Research in Scientific Methodology?Operation phaseAResearch phaseBAction phaseCJudgment phaseD

Question 7.Per unit contribution of a variable in the objective function is independent of the size of the variable. This property is known as _______ ? DeterministicAAutomotivenessBProportionalityCRationalityD

Question 8.A model of a proposed building provided by an architect is an example of ____________ model ? Analogue modelAPhysical modelBSymbolic modelCNone of the aboveD

Question 1.Post optimality analysis is also known as ______________ ? QuantitativeASensitivityBDeterministicCNone of the aboveD

Question 2.The dummy source or destination in a Transportation problem is added to ____________ ? Satisfy rim conditionAEnsure Transportation cost doesn’t exceed a limitBPrevent solution from becoming degenerateCTo select the shadow priceD

Question 3.A constraint is termed as ___________ if the LHS and RHS of it remains equal when the optimal value of the decision variables are substituted into the constraints .Redundant constraintANon-redundant constraintBNon-binding constraintCBinding constraintD

Question 4.Non-negativity condition is an important component of LP model because ____________ ? Variable value must remain under the control of decision makerAValue of variables make sense & correspond to real world problemBVariables are inter related in terms of limited resourcesCValue of variables remain unchangedD

Question 5.Which variable is also termed as dependant variable and which is beyond the control of the decision maker ? Decision variableAUncontrollable variableBResult variableCNone of the aboveD

Question 6.If two constraints do not intersect in the positive quadrant of the graph, then ________________ ? The problem is feasibleAThe solution is unboundedBOne of the constraints is redundantCNone of theseD

Question 7.A transportation problem has __________ basis ? Linear AQuadraticBTriangular CBoth A & CD

Question 8.If in a LP solution, the no. of simultaneous linear equation is ‘m’ and the no. of non-negative variables is ‘n’ , then the maximum no. of corner points is ________ ? mPnAnPmBmCnCnCmD

Question 1.Shadow price is ___________________________ ? Price that is paid for purchase of resourcesAThe saving made by eliminating excess quantity of resourcesBIncrease in obj. funcn value by providing one additional unit of resourceCThe difference in value between a feasible solution and optimal solutionD

Question 2.The role of artificial variables in the simplex method is _______? To aid in finding initial soln. & start phases of simplex methodATo find optimal dual prices in the final simplex tableBBoth of the aboveCNone of the aboveD

Question 3.The objective function is parallel to a constraint that forms an edge or boundary on the feasible region, this property is known as ____________ ? Multiple optimalityARedundancyBPre-emptivenessCInfeasibilityD

Question 4.A non-optimal solution cannot be improved by ___________ ? ASelecting variable with largest Dj(net profit) for maximization and min Dj for minimizationSelecting the variable with most non +ve replacement ratio as the outgoing variableBObtaining a new simplex tableCSelecting the variable in the optimality range tending to 0D

Question 5.For a maximization type of LPP, ____ property occurs where there is no constraint on the solution so that one or more of the decision variable can be increased indefinitely without violating any of the restrictions(constraints).Un-boundedness AInfeasibility BMultiple optimalityCExtensivenessD

Question 6.Which of the following is not a limitation of Operation Research ? Magnitude of computationANon-quantifiable factorsBMoney and time costsCDecision makingD

Question 7.If a negative value appears in the solution values(Xb) column of the simplex table then , The solution is optimalAThe solution is infeasibleBThe solution is unbalancedCAll of theseD

Question 8.A constraint in an LP model becomes redundant because ______ Two iso-profit lines may be parallel to each otherAThe solution is unboundedBThe constraint is not satisfied by the solution valueCAll of theseD

Question 1.The cutting plane method is designed for ____________ ? Developing another simplex algorithm that combines the primal & dual simplex methodsASolving zero-one programming problemsBEliminating integer optimal solutions from the feasible space of linear programming problemsCEliminating non-integer optimal solutions from the feasible space of linear programming problemsD

Question 2.If a problem has multiple objectives we should use which of the following methodologies ? Dynamic programmingAOrthogonal programmingBMultiplex programmingCGoal programmingD

Question 3.If a problem is best solved in stages or time frames, we should use which of the following methodologies ? Temporal programmingAGenetic programmingBDynamic programmingCInteger programmingD

Question 4.When an artificial variable is positive, it reverses the direction of the inequality in certain constraints. This solution of LPP is called Semi-feasible solutionAPseudo-optimal solutionBPseudo-feasible solutionCOptimized solutionD

Question 5.If we insist on obtaining only integer values of the decision variables, the problem is called ___________ ? Linear programming problemAInteger programming problemBNon-linear programming problemCRestricted programming problemD

Question 6.A solution is said to be degenerate _____________ ? If some basic variable(s) has a solution value equal to zeroAIf some non-basic variable(s) has a solution value equal to zeroBIf all basic variable (s) has a solution value equal to zeroCIf all non-basic variable(s) has a solution value equal to zeroD

Question 7.The method for dealing with linear programming problems involving artificial variables is _________ ? Two-phase methodASingle-phase methodBBig-L methodCAuxiliary methodD

Question 8.If two points are selected in the region and the line segment formed by joining these two points lies completely in this region, then it represents __________ .Non-convex setANon-continuous setBContinuous setCConvex setD

Question 1.An assignment problem is which form of transportation problem ? DegeneratedANon-degeneratedBUn-boundedCBasic formD

Question 2.____________ may involve decisions under certainty or uncertainty , under static or dynamic conditions and against nature or some rational opponents? Operations researchAQuantitative analysisBDecision makingCNone of the aboveD

Question 3.While plotting constants on a graph paper, terminal points on both the axes are connected by a straight line because _____ ? The resources are limited in supplyAThe objective function is a linear functionBThe constants are linear equations or inequalitiesCAll of the aboveD

Question 4.For a set of ‘m’ equation in ‘n’ variables(n>m), a solution obtained by setting (n-m) variables equal to zero and solving for remaining m equations in n variables is called as ________ ? Non-feasible solutionABasic feasible solutionBFeasible solutionCBasic solutionD

Question 5.Risk and payback period is considered to be______________ in a particular problem?VariablesAObjectiveBConstraintsCNone of the aboveD

Question 6.________ is a war against ad-hocism ? Deterministic modelAQualitative techniquesBOperational ResearchCAll of the aboveD

Question 7.A model in Operations research is ___________ ? An essence of reality AAn approximation BAn idealizationCAll of the aboveD

Question 8.Which of the following is not a feature of Operations research ? Inter-disciplinary team approachAHolistic approach to the systemBUse of scientific researchCPerfectness of solutionD

Bonus Round - RulesEach question carries 3 marks.

If you answer the question correctly within 60 seconds, you get 3 marks

You can take additional 30 seconds(total 90 seconds) to answer the question but a correct answer will fetch only 2 marks.

A wrong answer will attract a penalty of -1 in any case.

Unanswered questions are passable to the next group.

Linear Programming Quiz

More Related Content

What's hot (20)

Similar to Linear Programming Quiz (20)

More from Swatanu Satpathy (12)

Linear Programming Quiz