Unit - I: Class: TYBMS Subject: Operations Research Mcqs Q.1) Choose Correct Alternative in Each of The Following

Download as pdf or txt
Download as pdf or txt
You are on page 1of 10

Class: TYBMS

Subject : Operations Research

MCQs

Q.1) Choose correct alternative in each of the following.

UNIT - I
1.) Operation Research involves various ___________ to solve
problems.

A) Decision

B) Study

C) Techniques

D) Applications

2.) Operation Research provide a solution only when all the element
related to a problem can be _____________

A) Quantified

B) Qualified

C) Measure

D) Not defined

3.) This innovative science of operations Research was discovered


during _______.

A) Civil War
B) World War I
C) World War II
D) Industrial Revolution

4.) Objective function is expressed in term of the ___________

A) Number
B) Symbols
C) Decision Variables
D) Solutions

5.) In simplex method, feasible basic solution must satisfy the _____

A) Non-negative constraint
B) Negative constraint
C) Basic constraint
D) Common constraint

6.) According to algebra of simplex method, slack variables are


assigned zero coefficients because ______

A) No contribution in objective function


B) High contribution in objective function
C) Divisor contribution in objective function
D) Base contribution in objective function

7.) The tie in the replacement ratio indicate the solution is ______

A) Infeasible
B) Unbounded
C) Alternate
D) Degenerate

8.) In converting a less-than-or-equal constraint for use in a simplex


table, we must add ________

A) Slack variable
B) Surplus variable
C) Artificial variable
D) Alternate variable

9.) A feasible solution to an LPP

A) Must satisfy all of the problem’s constraints


simultaneously
B) Need not satisfy all of the constraints, only some of them
C) Must be a corner point of the feasible region
D) Must optimize the value of the objective function
10.) An iso-profit line represents

A) An infinite number of solutions all of which yield the same


profit.
B) An infinite number of solutions all of which yield the same
cost.
C) An infinite number of optimal solutions
D) A boundary of these feasible region

11.) If two constraints do not intersect in the positive quadrant of the


graph, then

A) The solution is unbounded


B) The problem is infeasible
C) One of the constraints is redundant
D) Represent optimal solution

12.) While solving the LP model graphically, the area bounded by the
constraints is called

A) Infeasible region
B) Unbounded region
C) Feasible region
D) Degenerate region

13.) Graphical method can be applied to solve a LPP when there are
only _________ variable

A) Four
B) Three
C) More than one
D) Two

14.) Alternate solutions exist of an LP model when

A) One of the constraints is redundant


B) Objective function equation is parallel to one of the
constraints
C) Two constraints are parallel
D) Adding another constraint
Unit - II
15.) The method used for solving an assignment problem is called

A) Reduced matrix method


B) MODI method
C) Hungarian method
D) VAM

16.) The purpose of a dummy row or column in an assignment


problem is to

A) Obtain balance between total activities and total resources


B) Prevent a solution from becoming degenerate
C) Provide a means of representing a dummy problem
D) Obtain the maximum use of resources

17.) The assignment problem is said to be balanced if total rows and


total capacities are _______

A) Not equal
B) Equal
C) Symmetric
D) Not defined

18.) Hungarian method was developed by _________

A) Harold Kuhn
B) Fisher
C) Vogel
D) Karl Pearson

19.) The purpose of the transportation approach for locational analysis


is to minimize _______

A) Total profit
B) Total shipping cost
C) Total variable cost
D) Total fixed cost

20.) A transportation problem has a feasible solution when _______

A) The number of filled cells is one less than the number of


rows plus the number of columns
B) All the squares are used
C) The solution yields the lowest possible cost
D) All demand and supply constraints are satisfied

21.) When total capacity is same as total demand it is said to be


__________

A) Balanced
B) Unbalanced
C) Feasible
D) Degenerate

22.) The following is used to test optimality test

A) North west corner method


B) Least cost method
C) Modified distribution method
D) Vogel’s approximation method

23.) Vogel’s Method is also known as

A) MODI method
B) Penalty method
C) NWCR method
D) Least cost method

24.) Penalty is defined as _________

A) Difference between least and next least cost


B) Difference between maximum and least cost
C) Difference between maximum and next maximum cost
D) Difference between maximum and minimum cost
25.) The loop i exist if

A) One of opportunity cost is positive


B) One of opportunity cost is negative
C) One of opportunity cost is zero
D) One of opportunity cost is not defined

26.) If One of opportunity cost is zero then

A) There is an alternate solution


B) There is degenerate solution
C) There is prohibited solution
D) There is no solution

27.) If one of the routes can not be used for transportation it is known
as __

A) Unbalanced transportation problem


B) Feasible transportation problem
C) Alternate transportation problem
D) Prohibited transportation problem

UNIT - III
28.) The critical path refers to ______

A) Longest path in terms of duration


B) Shortest path in terms of duration
C) Longest path in terms of length
D) Shortest path in terms of length

29.) The full form of CPM is

A) Critical project method


B) Critical path method
C) Critical path management
D) Critical project management
30.) PERT stands for _____

A) Project Evaluation and Review Techniques


B) Pollution Evaluation and Review Techniques
C) Path Evaluation and Review Techniques
D) Path Equation and Review Techniques

31.) A representation of a project with activities and event in a logical


sequence is known as _____

A) Event
B) Activity
C) Duration
D) Network Diagram

32.) __________ is applied for small and repetitive projects.

A) PERT
B) CPM
C) Network diagram
D) Critical path

33.) __________ is applied for huge and non-repetitive projects.

A) PERT
B) CPM
C) Network diagram
D) Critical path

34.) Crashing is also known as _______

A) Increasing duration of project


B) Time and cost trade off
C) Reducing duration of non-critical events
D) Profit and cost trade off

35.) In crashing we have to crash all activities on __________

A) Non-critical path
B) Critical path
C) Shortest path
D) Total path
36.) The variance of the activity in PERT is ___________
𝑏−𝑎 2
A) 𝜎 = ( )
6
𝑏±𝑎 2
B) 𝜎 = ( )
6
C) 𝜎 = (𝑏 − 𝑎)
𝑏
D) 𝜎 =
6

37.) If for an activity in PERT network if pessimistic time is 13 hrs,


optimistic time is 5hrs and most likely time is 9hrs then expected
time of that activity is _________ hrs.

A) 12
B) 14
C) 5
D) 9

38.) All activities lying on _______ are critical activities.

A) Path
B) Non critical path
C) Critical path
D) Shortest path

Unit - IV
39.) In the sequencing if the smallest time for a job belongs to
machine -1 then that job has to placed ______ of the sequence.

A) In the middle
B) In the starting
C) At end
D) At second position

40.) ________ operation is carried out on a machine at a time.

A) Two
B) At least one
C) Only one
D) More than one

41.) If there are n jobs to be performed, one at a time, on each of m


machine, the possible sequence would be

A) (𝑛!)𝑚
B) (𝑚!)𝑛
C) 𝑚𝑛
D) nm

42.) _________ is the process of determining which job to start first


and in what order other jobs should be processed on the machine
or in work centers.

A) Project work
B) Job series
C) Network
D) Job Sequencing

43.) Who develop the Game Theory.

A) J. R. Hicks
B) William J. Baumol
C) Neumann Morgenstern
D) Samuelson P. T.

44.) What is a saddle point.

A) Equilibrium point
B) Balanced growth point
C) Imbalanced growth point
D) Unstable equilibrium point

45.) in game theory, the outcome or consequences of a strategy is


referred to as the

A) Payoff
B) Penalty
C) Reward
D) End-game strategy
46.) A common assumption about the players in the game is that

A) Neither player knows the payoff matrix


B) The players have different information about the payoff
matrix
C) Only one of the players pursues a rational strategy
D) The specific identity of the players is irrelevant to the play of
the game.

47.) In a zero-sum game,

A) What one player wins, the other loses


B) The sum of each player’s winning if the game is played
many times must be zero
C) The game is fair – each person is equal chance of winning
D) Long run profit must be zero

48.) When the minimax and the maximin in pay off matrix are equal

A) It is indetermined solution
B) It is strictly determined solution
C) It can not be solved by two persons
D) It cannot be solved by a zero-sum game

49.) Game theory is concerned with

A) Predicting the result of bets placed on the game


B) The choice of an optimal strategy in conflict situations
C) Utility maximization by firms in competitive market
D) The migration patterns of caribou Alaska

50.) ______ time is the time on a machine, for which a machine does
not have a job to process.

A) Idle
B) Empty
C) Optimal
D) Infinite

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy