Course: B.

Tech III YEAR-I SEMESTER

Department: MECHANICAL ENGINEERING
Year: 2020-21
Subject Name: OPERATIONS RESEARCH
Faculty Name: M.VINOD KUMAR REDDY
UNIT-I
1. Operations research is the application of ____________methods to arrive at the optimal Solutions to the
problems.
a) Economical
b) Scientific
c) A and B
d) None
Answer: B
2. In operations research, the ------------------------------are prepared for situations.
a) mathematical models
b) physical models diagrammatic
c) diagrammatic models
d) None
A
3. Operations management can be defined as the application of ----------------------------------- -------to a problem
within a system to yield the optimal solution.
a) Suitable manpower
b) mathematical techniques, models, and tools
c) Financial operations
d) None
B
4. Operations research is based upon collected information, knowledge and advanced study of various factors
impacting a particular operation. This leads to more informed -----------
a) Management processes
b) Decision making
c) Procedures
d) None
B
5. Which of the following is not the phase of OR methodology?
a) Formulating a problem
b) Constructing a model
c) Establishing controls
 d) Controlling the environment
D
6. OR can evaluate only the effects of --------------------------------------------------.
a) Personnel factors.
b) Financial factors
c) Numeric and quantifiable factors.
d) None
C
7. The objective function and constraints are functions of two types of variables, _______________ variables
and ____________ variables
a) Positive and negative
b) Controllable and uncontrollable
c) Strong and weak
d) None of the above
B
8. Operations research was known as an ability to win a war without really going in to ____
a) Battle field
b) Fighting
c) The opponent
d) Both A and B
D
9. Who defined OR as scientific method of providing executive departments with a quantitative basis for
decisions regarding the operations under their control?
a) Morse and Kimball (1946)
b) P.M.S. Blackett (1948)
c) E.L. Arnoff and M.J. Netzorg
d) None of the above

10. OR has a characteristic that it is done by a team of

a) Scientists
b) Mathematicians
c) Academics
d) All of the above
D
11. Hungarian Method is used to solve
a) A transportation problem
b) A travelling salesman problem
c) A LP problem
d) Both a & b
B
12. A solution can be extracted from a model either by
a) Conducting experiments on it
 b) Mathematical analysis
c) Both A and B
d) Diversified Techniques
C
13. OR uses models to help the management to determine its _____________
a) Policies
b) Actions
c) Both A and B
d) None of the above
C
14. What have been constructed from OR problems an methods for solving the models that are available in many
cases?
a) Scientific Models
b) Algorithms
c) Mathematical Models
d) None
C
15. Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or
cost reduction under certain constraints?
a) Quailing Theory
b) Waiting Line
c) Both A and B
d) Linear Programming
D
16. What enables us to determine the earliest and latest times for each of the events and activities and thereby
helps in the identification of the critical path?
a) Programme Evaluation
b) Review Technique (PERT)
c) Both A and B
d) Deployment of resources
D
17. OR techniques help the directing authority in optimum allocation of various limited resources
like_____________
a) Men and Machine
b) Money
c) Material and time
d) All
D
18. The Operations research technique which helps in minimizing total waiting and service costs is
a) Queuing Theory
b) Decision Theory
c) Both A and B
d) None of the above
A
19. What is the objective function in linear programming problems?
a) A constraint for available resource
b) An objective for research and development of a company
c) A linear function in an optimization problem
d) A set of non-negativity conditions
C
20. Which statement characterizes standard form of a linear programming problem?
a) Constraints are given by inequalities of any type
b) Constraints are given by a set of linear equations
c) Constraints are given only by inequalities of >= type
d) Constraints are given only by inequalities of <= type
A
21. Feasible solution satisfies __________
a) Only constraints
b) only non-negative restriction
c) [a] and [b] both
d) [a],[b] and Optimum solution
C
22. In Degenerate solution value of objective function _____________.
a) increases infinitely
b) basic variables are nonzero
c) decreases infinitely
d) One or more basic variables are zero
D
23. Minimize Z = ______________
a) –maximize(Z)
b) -maximize(-Z)
c) maximize(-Z)
d) none of the above
B
24. In graphical method the restriction on number of constraints is __________.
a) 2
b) not more than 3
c) 3
d) None
D
25. In graphical representation the bounded region is known as _________ region.
a) Solution
b) Basic solution
c) Feasible solution
 d) Optimal
C
26. Graphical optimal value for Z can be obtained from
a) Corner points of feasible region
b) Both a and c
c) corner points of the solution region
d) none of the above
A
27. In LPP the condition to be satisfied is
a) Constraints have to be linear
b) Objective function has to be linear
c) none of the above
d) both a and b
D
28. Identify the type of the feasible region given by the set of inequalities x - y <= 1 x - y >= 2 where both x and y
are positive.
a) A triangle
b) A rectangle
c) An unbounded region
d) An empty region
D
29. Consider the linear equation 2 x1 + 3 x2 - 4 x3 + 5 x4 = 10 How many basic and non-basic variables are defined
by this equation?
a) One variable is basic, three variables are non-basic
b) Two variables are basic, two variables are non-basic
c) Three variables are basic, one variable is non-basic
d) All four variables are basic
A
30. Who coined the term Operations Research?
a) J.F. McCloskey
b) F.N. Trefethen
c) P.F. Adams
d) Both A and B
D
31. In simplex method, we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=
a) Slack Variable
b) Surplus Variable
c) Artificial Variable
d) None of the above
C
32. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐ ‐‐‐‐‐‐‐‐‐‐‐‐‐
‐ should be selected
 a) Slack Variable
b) Surplus Variable
c) Decision Variable
d) None of the above
C
33. If there are ‘m’ original variables and ‘n’ introduced variables, then there will be ‐‐‐‐‐‐‐‐‐‐‐‐‐ columns in the
simplex table
a) M + n
b) M – n
c) 3 +m + n
d) M + n – 1

34. A minimization problem can be converted into a maximization problem by changing the sign of coefficients in
the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Constraints
b) Objective Functions
c) Both A and B
d) None
B
35. If in an LPP, the solution of a variable can be made infinity large without violating the constrai the solution is ‐‐
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
d) None
B
36. In maximization cases, ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients in the objective
function
a) +m
b) -m
c) 0
d) None
A
37. Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable
a) One
b) More than one
c) Two
d) Three
C
38. If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
 d) None
A
39. The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐
a) Unit Variables
b) Basic Variables
c) Non basic Variables
d) None
B
40. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vector
b) Key column
c) Key Row
d) None
A
UNIT-II
1. MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimal solutions
b) Optimality test
c) Both A and B
d) Optimization
Answer: C
2. For solving an assignment problem, which method is used?
a) Hungarian
b) American
c) German
d) Both are incorrect
A
3. To make an unbalanced assignment problem balanced, what are added with all entries as zeroes?
a) Dummy rows
b) Dummy columns
c) Both A and B
d) Dummy entries
C
4. Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim requirement) is called
a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Linear programming
b) Basic feasible solution
c) Feasible solution
d) None
C
5. A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐
‐‐‐‐‐‐‐
 a) m‐n+1
b) m‐n‐1
c) m+n‐1
d) None
C
6. Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐
‐‐‐
a) Independent
b) Degenerate
c) Non‐degenerate
d) Both A and B
C
7. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are occupied is
called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Occupied path
b) Open path
c) Closed path
d) None
C
8. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D
destinations
a) Goods
b) Products
c) Items
d) None
A
9. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Simple problem
b) Balanced problem
c) Transportation problem
d) None of the above
B
10. Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow
a) Negative
b) Positive
c) One
d) Zero
D
11. According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m+n‐0
b) n+m‐1
c) m+n‐1
 d) None
C
12. Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐ ‐‐‐‐‐‐ column
incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less than the demand
a) O, D
b) m, n
c) Horizontal, Vertical
d) Unshipped supply, Shortage
D
13. In which phase is optimization done and how does that phase also checks for optimality conditions?
a) Phase III
b) Phase I
c) Phase II
d) None
C
14. Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells?
a) Negligent costs
b) Advanced costs
c) Reduced costs
d) None
C
15. A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimization
b) Demand
c) Cost
d) None
B
16. If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with ‐‐‐‐‐‐
‐‐‐‐‐‐‐
a) Dummy Demand
b) Dummy Supply
c) Zero Cost
d) Both A and B
C
17. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
a) LPP
b) VAM
c) MODI
d) RIM
C
18. For maximization in TP, the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
a) Solution
 b) Profit Matrix
c) Profit
d) None
C
19. VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vogeal’s Approximation Method
b) Vogel’s Approximate Method
c) Vangel’s Approximation Method
d) Vogel’s Approximation Method
D
20. Once the initial basic feasible solution has been computed, what is the next step in the problem
a) VAM
b) Modified distribution method
c) Optimality test
d) None
C
21. One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐?
a) VAM
b) Modified distribution method
c) Optimality test
d) None
A
22. What do we apply in order to determine the optimum solution?
a) LPP
b) VAM
c) MODI
d) None
C
23. In a TP, if the number of non‐negative independent allocation is ‐‐‐‐‐‐‐‐‐‐‐‐ than m+n‐1.
a) Equivalent
b) Greater
c) Less
d) None
C
24. _______ occurs when the number of occupied squares is less than the number of rows plus
a) Degeneracy
b) Infeasibility
c) Unboundedness
d) Unbalance
A
25. The method of finding an initial solution based upon opportunity costs is called __________.
 a) the northwest corner rule
b) Vogel's approximation
c) Johansson’s theorem
d) Flood's technique
B
26. __________ or __________ are used to "balance" an assignment or transportation problem.
a) Destinations; sources
b) Units supplied; units demanded
c) Dummy rows; dummy columns
d) Large cost coefficients; small cost coefficients
C
27. In a transportation problem, we must make the number of __________ and __________ equal.
a) destinations; sources
b) units supplied; units demanded
c) columns; rows
d) positive cost coefficients; negative cost coefficients
B
28. What is the difference between minimal cost network flows and transportation problems?
a) The minimal cost network flows are special cases of transportation problems
b) The transportation problems are special cases of the minimal cost network flows
c) There is no difference
The transportation problems are formulated in terms of tableaus, while the minimal cost network flows
d) are formulated in terms of graphs
B
29. With the transportation technique, the initial solution can be generated in any fashion one chooses. The only
restriction is that
a) the edge constraints for supply and demand are satisfied.
b) the solution is not degenerate.
c) the solution must be optimal.
d) one must use the northwest-corner method.
A
30. Which of the following is NOT needed to use the transportation model?
a) the cost of shipping one unit from each origin to each destination
b) the destination points and the demand per period at each
c) the origin points and the capacity or supply per period at each
d) Degeneracy
D
31. Which of the following is a method for improving an initial solution in a transportation problem?
a) northwest-corner
b) intuitive lowest-cost
c) southeast-corner rule
d) stepping-stone
D
32. Which of the following is used to come up with a solution to the assignment problem?
a) MODI
b) North west corner
c) Stepping stone
d) Hungarian
D
33. Penalties are used in
a) Two phase method
b) Big M method
c) Dual method
d) All
B
34. The model parameters of linear programming model are
a) Objective Coefficient
b) Constraint coefficient
c) A & B
d) None
C
35. The minimum ratio is neglected if
a) Zero
b) Negative
c) Infinity
d) Infinity or negative
D
36. The number of optimal solutions of LPP for maximizing objective function on
Unbounded feasible region is
a) Infeasible
b) Unique
c) multiple
d) infinite
D
37. The number of basic feasible solutions in a feasible region will be
a) Finite
b) Infinite
c) Zero
d) None
A
38. The solution of any transportation problem is obtained in how many stages?
a) 5
b) 4
 c) 3
d) 2
D
39. An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution
a) 3
b) 1
c) 2
d) Final
C
40. MODI method is used to obtain_____
a) Optimal solution
b) Optimality test
c) Both A and B
d) optimization
C
UNIT-III
1. The number of possible sequences (theoretical) which minimize the total elapsed time
for ‘3’ jobs to be performed one at a time on each of ‘3’ machines is
a) 6
b) 9
c) 8
d) 216
Answer: D
2. The time interval between starting the first job and completing the last job including
the idle time in a particular order by the given set of machines is called
a) Idle time
b) Total elapsed time
c) Machine time
d) None
B
3. If two jobs J 1 and J 2 have same process times in both series we prefer
a) J1
b) J2
c) J1&J2
d) J1 OR J2
D
4. The replacement policy that is imposed on an item irrespective of its failure (i.e. it is
replaced even though it has not failed) is
a) Individual replacement
b) Group replacement
c) If money value is constant
d) None
B
5. Jobs A to E have process times as 12,4,20,14 and 22 on 1 st Machine and 6,14, 16, 18
and 10 on 2 nd Machine, the optimal sequence is
a) CEABD
b) AECDB
c) BCDEA
d) BDCEA
D
6. In replacement analysis the maintenance cost is the function of
a) Present value
b) Time
c) Maintenance policy
d) Resale value
B
7. The sequencing rule usually followed at a petrol bank when ‘n’ vehicles are waiting, is
a) FIFO
b) LIFO
c) Lowest process time
d) Highest profit time
A
8. In a maximization case of sequencing two machines x n jobs the job is placed at
available left first position if it has process time in machine series. [B]
a) Least, first
b) Highest, first
c) Least, second
d) Highest, second
B
9. If a job has zero process time for any machine the job must
a) First position
b) Last position
c) Extreme position
d) none
C
10. In a 2*n machine sequencing, a line at 45 degrees represents
a) Job 1 is idle
b) Job 2 is idle
c) Both idle
d) No Job is idle
D
11. If the number of minimum lines is less the order of matrix then it means
a) Optimization is already achieved
b) One more line is to be drawn
 c) Allocation is wrong
d) There is a scope for further optimization
B
12. The time required for printing of four project reports P,Q,R and S is 4,7,9 and 6 hrs
while its data entry requires 6,3,2 and 5 hrs respectively. The sequence that minimizes the
total elapse is
a) PSQR
b) PQRS
c) PSRQ
d) RQSP
D
13. In sequencing an optimal path is one that minimizes
a) Elapsed time
b) Idle time
c) Processing time
d) None
B
14. When the money value is changing with time @20%, the discount factor for 2nd year
a) 1
b) 0.833
c) 0.909
d) zero
B
15. The following rule is used in sequencing
a) Hungarian
b) Johnson’s
c) Monte-Carlo
d) VAM
B
16. No passing rule means
a) A job once loaded on a machine should not be removed until it is completed.
b) A job cannot be processes on second machine unless it is processes on first machine.
c) both
d) None
B
17. According to Johnson’s rule, the smallest processing time if occurs in
a) First series, place it in the first available position
b) Second series, place it in first available position
c) First series, Place it middle
d) None
A
18. In which of the following we get multiple optimal solutions
 a) Same least time for two jobs in both series of machines of 2*n jobs sequence model.
If we can convert the zeros as the corners of a rectangular loop, allocated cells
b) alternatively, in AP or TP.
If objective function has same slope to that of one of non-redundant constraint of an
c)
LPP.
d) All
D
19. If the number of rows exceeds the number of columns by 2, then we add
a) Dummy row
b) 2 dummy rows
c) Dummy column
d) 2 dummy columns
D
20. Which of the following is always a balanced problem?
a) Transportation
b) Assignment
c) Travelling sales man
d) none
C

*******The End*******