K1-Level Questions Unit I
K1-Level Questions Unit I
UNIT I
b. Zadeh
c. John
2. In a two-person zero-sum game, the pay-off matrix of player B is the ------------ of the
pay-off matrix of the player A.
a. negative
b. positive
c. neither a or b
d. both a and b
5. In two-person game, if the gains of one player are equal to the losses of the other player,
such a game is called ------
a. two-person game
b. zero-sum game
c. neither a or b
d. both a and b
6. The predetermined rule by which a player decides as to how to use his courses of action
in the different plays of a game from his own list of available courses of action during the
game is termed as the --------------of the player.
a. pure strategy
b. strategy
c. mixed strategy
d. neither a or b
7. A decision to always choose only one particular course of action out of the list of all the
courses of action available to him is termed as ------------
A .pure strategy
b. strategy
c. both a and b
d. mixed strategy
8. A decision to choose a course of action for each play, in accordance with some particular
probability distribution, is termed as -----------
a. pure strategy
b. mixed strategy
c. strategy
9. In a rectangular game, the maximum guaranteed gain to the maximizing player, when
both the players use their optimal strategies, is called the-------------
a. sum of the game
b. strategy
c. value of the game
d. none of the above
10. If the value of a two-person zero-sum game is equal to zero, such a game is called a ------
-----
a. fair game
b. value of the game
c. sum of the game
d. none of the above
UNIT II
11. In a sequencing problems, a general methodology of solution to find the optimal
sequence for n jobs and m machines, where n and m are finite numbers, is -------------.
a. available
b. zero
c. five
d. not available
12. To determine the optimal sequence for a n job 3 machine problem, the condition to be
satisfied is -----------------
a. (t1)min≥ (t2)max
b. (t1)max≤ (t2)min
c. (t3)min≥ (t2)max
d. both a and c
13. Which one is correct, while in terms of the processing times of the jobs on the 3
machines, and when the processing order of all the jobs on the 3 machines ?
14. To determine the optimal sequence for a n job m machines problem, the condition to be
satisfied is --------------
a. (t1)min≥ (t2,t3,t4,...,tm-1)max
b. (tm)min≥(t2,t3,t4,....,tm-1)max
c. both a and b
d. t1>t2
15. What is the condition to determine the optimum for processing times of the jobs on the
m machines, and when the processing order of all the jobs on the m machines ?
16. To determine the optimal sequence for a 2 job n machine problem, the order of
processing of the machines for both the jobs----------
a. Need not be the same
b. be the same
c. n>2
d. n<2
17. Consider a 5-job 3-machine problem with the processing order as A-B-C for all the 5-
jobs with processing time as follows:
Job 1 2 3 4 5
Processing time on A(hrs) 3 8 7 4 9
Processing time on B(hrs) 6 7 5 11 5
Processing time on C(hrs) 4 3 2 5 1
Is it possible to determine the optimal sequence of the jobs on the three machines for this
problem?
a. yes
b. no
c. indefinable
d. neither a or b
18. Consider a 6-job 3-machine problem with the processing order as A-B-C for all the 6-
jobs with processing time as follows:
Job 1 2 3 4 5 6
Processing time on A(hrs) 3 8 7 4 9 8
Processing time on B(hrs) 6 7 5 11 5 9
Processing time on C(hrs) 4 3 2 5 1 6
Is it possible to determine the optimal sequence of the jobs on the three machines for this
problem?
a. yes
b. no
c. indefinable
d. neither a or b
19. Consider a 4-job 5-machine problem with the processing order as A-B-C-D-E for all the
4-jobs and with processing time as follows:
Machines
A B C D E
1 8 4 3 2 8
Jobs 2 9 6 5 4 11
3 5 5 2 3 9
4 6 2 4 6 7
Is it possible to determine the optimal sequence of the jobs on the five machines
for this problem?
a. yes
b. no
c. indefinable
d. neither a or b
20. Suppose you have 2 jobs to be processed on 4 machines A, B,C and D. Should the
processing order for both the jobs be the same on all the 4 machines?
a. no
b. yes
c. indefinable
d. neither a or b
UNIT III
21. Inventory may be defined as a
(a) Stocks of goods
(b) Capital invested in goods
(c) Space for storing goods
(d) Ledger to maintain the list of goods
22. The inventory may be categorized as
(a) Raw material inventory
(b) In-process inventory
(c) Finished goods inventory
(d) All the above
23. Which of the following is a controllable variable in inventory management?
(a) Cost of insurance
(b) Shortage cost
(c) Rent for the storage space
(d) None of the above
24. Which of the following is a controllable variable in inventory management?
(a) Cost of the staff
(b) Lead time
(c) Frequency of acquisition of inventory
(d) Deterioration cost
25. Which of the following is a uncontrollable variable in inventory management?
(a) The quantity acquired
(b) Lead Time
(c) Frequency of acquisition of inventory
(d) None of the above
26. Which of the following is a uncontrollable variable in inventory management?
(a) The Quantity acquired
(b) Frequency of acquisition of inventory
(c) Interest on the money locked in the inventory
(d) Stage of Completion of the stocked items
27. The inventory set-up costs are proportional to
(a) The level of inventory
(b) Time for which the inventory is held
(c) Delay time
(d) None of the above
28. The situation where the shortages can be fulfilled at a date later than the scheduled
delivery date, when the commodity becomes available is called the
(a) Lead time
(b) Back logging
(c) Uniform replenishment
(d) Loss of good will
29. The lead time is placed in the category of
(a) Holding cost
(b) Shortage cost
(c) Uncontrollable variables of inventory
(d) Back logging
30. The unsatisfied demand is lost in the case of
(a) Shortages without back logging
(b) Shortages with back logging
(c) No lead time
(d) Too much lead time
Unit IV
31. The inventory needs to be maintained to decrease the --------
(a) Shortage cost
(b) Set-up cost
(c) Loss of good will
(d) All the above
32. Which of the following is needed to prevent the loss of goodwill due to unsatisfied
demand-------
(a) Backlogging of orders
(b) Zero lead time
(c) Finished goods
(d) All the above
33. In which type of demand is the future demand determined by collecting the statistical
data from past experience?
(a) Deterministic demand
(b) Probabilistic demand
(c) Variable demand
(d) Predictable demand
34. In which type of demand is the future demand assumed to be fixed and completely
known?
(a) Deterministic demand
(b) Probabilistic demand
(c) Uniform demand
(d) Predictable demand
35. In the case of economic lot size model with uniform rate of demand r, infinite production
rate, and having no shortages, the optimal quantity of items produced per production run
is given by ----------
Ǵ
(a) î
Ǵ
(b) î
(c) (2
.
(d)î . +
36. In the case of economic lot size model with uniform rate of demand r, infinite production
rate, and having no shortages, the minimum average cost of inventory is given by ----
(a) î
(b) î
(c) ( ǴǴ
.
(d)î . +
37. In the case of economic lot size model with uniform rate of demand r, infinite production
rate, and having no shortages, the optimal frequency of acquisition of inventory is given
by -------------
(a) î
Ǵ
(b) î
Ǵ
(c) (2
.
(d)î . +
38. In the case of economic lot size model, with different rates of demand in different
production cycles, the total demand in total(fixed) period t being R, infinite production
rate, and having no shortages, the optimal quantity of items produced per production run
is given by ----------
(a) î
(b) î
Ǵ
(c) î
Ǵ
.
(d)î . +
39. In the case of economic lot size model, with different rates of demand in different
production cycles, the total demand in total(fixed) period t being R, infinite production
rate, and having no shortages, the minimum average cost of inventory is given by --------
Ǵ Ǵ
(a) î
(b) î
(c) î
.
(d)î . +
40. In the case of economic lot size model, with uniform rate of demand r, finite rate of
replenishment k, and having no shortages, the optimal quantity of items produced per
production run is given by--------
(a) î
(b) î
.
(c) î
Ǵ
.
(d)î . +
41. In the purchase inventory model with one price breaks, the price break quantity being
, and shortages not being allowed, if ∗ < , and if ( ∗ ) < ( ), then which of
the following is the optimal order quantity?
(a) ∗
(b) − ∗
(c) ∗
(d)
ǖƼ ú−
42. Network analysis is applied to projects which are
(a) Routine or Repetitive
(b) Not Routine or repetitive
(c) Used only once
(d) Used very rarely
43. Network analysis is a technique to minimize some performance measure of the system
such as
(a) total completion time of the project
(b) The overall cost of the project
(c) The resources used for the project
(d) All the above
44. The two major aspects of the critical path method are
(a) Planning and Scheduling
(b) Planning and implementation
(c) Planning and organization
(d) Organization and scheduling
45. In the critical path method, determination of the activities to be performed, and the order
in which these activities shall be performed come under the aspect of
(a) Planning
(b) Scheduling
(c) Organizing
(d) None of the above
46. In the critical path method, preparing the time estimates for each activity comes under the
aspect of
(a) Planning
(b) Organizing
(c) Scheduling
(d) Estimating
47. In the program evaluation and review technique, the expected time of completion of an
activity is computed from 3 time estimates, which are the
(a) Favourable time, normal time , and unfavourable time
(b) Optimistic time, Normal time, and Pessimistic time
(c) Optimistic time, Favourable time, and Pessimistic time
(d) Optimistic time, Most likely time, and Pessimistic time
48. In CPM/PERT, the critical path is the path having the
(a) Minimum time duration
(b) Normal time duration
(c) Most difficult to achieve time duration
(d) None of the above
49. Which of the following is not involved in determining the time estimates of activities in
the critical path method?
(a) Role of the project management
(b) Statistical analysis
(c) Skills of the concerned personnel
(d) Mathematical reasoning
50. In the critical path method , it is assumed that the time required for each activity is
(a) Known precisely
(b) Known Approximately
(c) Known in a probabilistic sense
(d) Uncertain
51. In PERT, it is assumed that the time required to perform each activity is
(a) Known precisely
(b) Known Approximately
(c) Known in a probabilistic sense
(d) Uncertain
OPERATIONS RESEARCH II
K2-LEVEL QUESTIONS
UNIT I
1. In a two-person zero-sum game, the pay-off matrix of player B is the ------------ of the
pay-off matrix of the player A.
negative
2. Write the another name of Two-person zero-sum game.
Rectangular
3. Say True or False: In a competitive game, every play determines an outcome to each
player.
True
4. Define zero-sum game.
In two-person game, if the gains of one player are equal to the losses of the other
player, such a game is called zero-sum game.
5. Define strategy of the player.
The predetermined rule by which a player decides as to how to use his courses of
action in the different plays of a game from his own list of available courses of action
during the game is termed as the strategy of the player.
6. Define pure strategy.
A decision to always choose only one particular course of action out of the list of all
the courses of action available to him is termed as pure strategy.
7. Define value of the game.
In a rectangular game, the maximum guaranteed gain to the maximizing player,
when both the players use their optimal strategies, is called the value of the game.
8. Define Fair game.
If the value of a two-person zero-sum game is equal to zero, such a game is called a
fair game.
9. In a rectangular game, if the maximin value of the maximizing player is less than the
minimax value of the minimizing player, the former is termed as:
Lower value of the game
10. Define saddle point.
In a rectangular game, if the upper value of the game coincides with the lower value
of the game, the element in this position is termed as the saddle point.
UNIT II
11. What is the condition, to determine the optimal sequence for a n job 3 machine problem?
(t1)min≥ (t2)max and . (t3)min≥ (t2)max
12. What are the conditions to determine the optimal sequence for a n job m machines
problem?
(t1)min≥ (t2,t3,t4,...,tm-1)max and (tm)min≥(t2,t3,t4,....,tm-1)max
13. To determine the optimal sequence for a 2 job n machine problem, the order of
processing of the machines for both the jobs must be same. Say True or False.
False
14. Consider a 5-job 3-machine problem with the processing order as A-B-C for all the 5-
jobs with processing time as follows:
Job 1 2 3 4 5
Processing time on A(hrs) 3 8 7 4 9
Processing time on B(hrs) 6 7 5 11 5
Processing time on C(hrs) 4 3 2 5 1
Is it possible to determine the optimal sequence of the jobs on the three machines for this
problem?
yes
15. Consider a 6-job 3-machine problem with the processing order as A-B-C for all the 6-
jobs with processing time as follows:
Job 1 2 3 4 5 6
Processing time on A(hrs) 3 8 7 4 9 8
Processing time on B(hrs) 6 7 5 11 5 9
Processing time on C(hrs) 4 3 2 5 1 6
Is it possible to determine the optimal sequence of the jobs on the three machines for this
problem?
no
16. Consider a 4-job 5-machine problem with the processing order as A-B-C-D-E for all the
4-jobs and with processing time as follows:
Machines
A B C D E
1 8 4 3 2 8
Jobs 2 9 6 5 4 11
3 5 5 2 3 9
4 6 2 4 6 7
Is it possible to determine the optimal sequence of the jobs on the five machines
for this problem?
yes
17. Suppose you have 2 jobs to be processed on 4 machines A, B,C and D. Should the
processing order for both the jobs be the same on all the 4 machines?
no
18. Suppose you have 3 jobs to be processed on 4 machines A,B,C and D. The processing
order for all the 3 jobs on the 4 machines should be
A-B-C-D or D-C-B-A or B-C-D-A
19. The graphical method of solution can be applied to determine the optimal sequence for
the problem of :
2 jobs and m machines
20. In an n job 2 machine sequencing problem, the sum of total processing times for all the
jobs on a machine and the total idle time of the machine shall be =
The total elapsed time
UNIT III
UNIT IV
é.
^
ƅ − é
38. In the case of economic lot size model, with uniform rate of demand r, finite rate of
replenishment k, and having no shortages, the minimum average cost of inventory is
given by:
é
é −
39. In the purchase inventory model with one price breaks, the price break quantity being
, ∗ will be the optimal order quantity if:
∗
≥
40. In the purchase inventory model with one price breaks, the price break quantity being
, and shortages not being allowed, if ∗ < , and if Z ( ∗ ) < Z ( ), then which of
the following is the optimal order quantity?
UNIT V
41. Network analysis is applied to projects which are
Not Routine or repetitive
42. The two major aspects of the critical path method are
Planning and Scheduling
43. In the critical path method, preparing the time estimates for each activity comes under the
aspect of:
Scheduling
44. In the program evaluation and review technique, the expected time of completion of an
activity is computed from 3 time estimates, which are:
Optimistic time, Most likely time, and Pessimistic time
45. In the critical path method , it is assumed that the time required for each activity is
Known precisely
46. In PERT, it is assumed that the time required to perform each activity is
Uncertain
47. Which of the following represents a point of start or a point of completion of an activity?
Event
48. In PERT terminology, each event in a network diagram is represented by
A Circle
49. In a network diagram, an event which is a beginning event for two or more activities is
called:
A Node
50. In a network diagram, an event where two or more activities end is called
A Burst
K3 LEVEL QUESTIONS
UNIT I
UNIT II
1. Explain about optimum sequence algorithm for processing n jobs through two machines.
2. Explain about optimum sequence algorithm for processing n jobs through k machines.
3. How to get optimum value using graphical method for processing two jobs through k
machines.
4. In a factory, there are 6 jobs to perform each opf which should go through 2 machines A
and B, in the order A,B. The processing timings (in hours) for the jobs are given here.
You are required to determine the sequence for performing the jobs that would minimize
the total elapsed time T. What is the value of T?
Job J1 J2 J3 J4 J5 J6
Machine A 1 3 8 5 6 3
Machine B 5 6 3 2 2 10
5. A book binder has one printing press, one binding machine, and the manuscript of a
number of different books. The time required to performing to printing and binding
operations for each book is shown below. Determine the order in which books should be
processed, in order to minimize the total time require to turn out all the books:
Book 1 2 3 4 5 6
Printing time(hrs) 30 120 50 20 90 100
Binding time(hrs) 80 100 90 60 30 10
6. We have five jobs each of which must go through the two machines A and B in the order
AB. Processing times in hours are given in the table below:
Job 1 2 3 4 5
Machine A 5 1 9 3 10
Machine B 2 6 7 8 4
Determine a sequence for the five jobs that will minimize the elapsed time.
7. A ready-made garment company has to process seven items through two stages of
production, viz., cutting and sewing. The time taken by each of these items at the
different stages are given as:
Item : 1 2 3 4 5 6 7
Cutting: 4 8 3 5 5 12 7
Sewing: 3 5 6 4 8 5 8
Find an order in which these seven items are to be processed so as to minimize the total
processing time.
8. Determine optimal sequence of jobs that minimizes the total elapsed time based on the
following information processing time on machines is given in hours and passing is not
allowed:
Job A B C D E F G
Machine M1 3 8 7 4 9 8 7
Machine M2 4 3 2 5 1 4 3
Machine M3 6 7 5 11 5 6 12
9. We have four jobs each of which has to go through the machines Mj (j = 1,….6) in the
order M1,….M6. Processing time (in hrs) is given below:
Machines
M1 M2 M3 M4 M5 M6
Job A 18 8 7 2 10 25
Job B 17 6 9 6 8 19
Job C 11 5 8 5 7 15
Job D 20 4 3 4 8 12
Determine a sequence of these four jobs that minimizes the total elapsed time.
10. We have five jobs, each of which must go through the machines A, B and C in the order
ABC. Processing times (in hrs) are given in the following table:
Job 1 2 3 4 5 6 7
Machine A 7 8 11 14 21 17 8
Machine B 6 3 1 2 5 4 1
Machine C 10 9 15 13 18 11 9
UNIT III
UNIT IV
UNIT V
UNIT I
2 2 3 −2
1. Solve the following 2 x 2 game graphically.R
4 3 2 6
3 −3 4
2. Solve the following 2 x 2 game graphically.R
−1 1 −3
1 2
5 4
3. Solve the following 2 x 2 game graphically. − 7 9
−4 −3
2 1
−4 3
−7 1
4. Solve the following 2 x 2 game graphically − 2 − 4
−5 −2
−1 −6
5. For what value of , the game with following pay off matrix is strictly determinable?
6 2
−1 −7
−2 4
UNIT II
1. Determine the optimal sequence of jobs that minimizes the total elapsed time based
on the following information.
Job 1 2 3 4 5 6 7
Machine A 10 8 12 6 9 11 9
Machine B 6 4 6 5 3 4 2
Machine C 8 7 5 9 10 6 5
Processing time on machines is given in hrs and passing is not allowed.
2. Use graphical method to minimize the time added to process the following jobs on
machines shown, that is for each machine find the job which should be done first.
Also calculate the total time elapsed to complete both the jobs:
Job 1 Sequence A B C D E
Time 3 4 2 6 2
Job 2 Sequence B C A D E
Time 5 4 3 2 6
3. Using graphical method, calculate the minimum time needed to process job 1 and 2
on 5 machines A,B,C,D and E. , that is for each machine find the job which should be
done first. Also calculate the total time elapsed to complete both the jobs:
Job 1 Sequence A B C D E
Time 6 8 4 12 4
Job 2 Sequence B C A D E
Time 10 8 6 4 12
4. A machine shop has four machines A,B,C and D. two jobs must be processed through
each of these machines. The time taken on each of the machines and the necessary
sequence of jobs through the shop are given below:
Job 1 Sequence A B C D
Time 2 4 5 1
Job 2 Sequence D B A C
Time 6 4 2 3
Use graphic method to obtain the total minimum elapsed time.
5. Use graphic method to find the minimum elapsed total time sequence of two jobs and
five machines when we are given the following information:
Job 1 Sequence A B C D E
Time 2 3 4 6 2
Job 2 Sequence C A D E B
Time 4 5 3 2 6
UNIT III
1. A certain item costs Rs.235 per tonne. The monthly requirement is 5 tonnes and
each time the stock is replenished, there is a set-up cost of Rs.1000. the cost of
carrying inventory has been estimated at 10% of the value of the stock per year.
What is the optimal order quantity?
2. A company manufacturers a product having a monthly demand of 2000 units. For
one unit of product 2 kg of a particular raw material item is needed. The purchase
price of the material is Rs 20 per kg. the ordering cost is Rs 120 per order and the
holding cost is 10 per cent per annum.
Calculate:
1) Economic ordering quantity (EOQ), and
2) Annual cost of purchasing and storage of the raw material at the quantity.
3. A company operating 50 weeks in a year is concerned about its stocks of copper
cable. This costs Rs 240 a meter and there is a demand for 8000 meters a week.
Each replenishment costs Rs 1050 for administration and Rs 1650 for delivery,
while holding costs are estimated at 25 per cent of value held a year. Assuming no
shortages are allowed, what is the optimal inventory policy for the company?
How would is analysis differ if the company wanted to maximize profit rather
than minimize cost? What is the gross profit if the company sell cable for Rs 360 a
meter.
4. A company plans to consume 760 pieces of a particular component. Past records
indicate that purchase department had used Rs 12000 for placing 15000 orders.
The average inventory was valued at Rs 45000 and the total storage cost was Rs
7650 which included wages, rent, taxes, insurance, etc. related to store
department. The company borrows capital at the rate of 10% a year.
If the price of a component is Rs 12 and the order size is of 10 components,
determine: purchase cost, purchase expenses, storage expenses, capital cost and
total cost per year.
5. An aircraft uses rivets at an approximately constant rate of 5000 kg per year. The
rivets costs Rs. 20/kg and the company personnel estimate that it cost Rs.200 to
place an order, and the carrying cost of inventory is 10% per year.
a. How frequently should orders for rivets be places, and what quantities
should be ordered for?
b. If the actual cost are Rs. 500 to place an order and 15% for carrying cost
the optimum policy would change. How much is the company loosing per
year because of imperfect cost information?
UNIT IV
1. Find the optimum order quantity for a product for which the price breaks are as
follows:
Quantity Unit Cost(Rs)
0 ≤ Q1 ≤ 800 1.00
800 ≤ Q2 0.98
The yearly demand for the product is 1600 units per year, cost of placing an order is
Rs. 5, the cost of storage is 10% per year.
2. The annual demand for an item of inventory whose price is Rs. 10/ unit is 2400 units,
ordering cost per order is Rs. 350 and inventory holding costs are 2% /month. The
supplier offers a quantity discount of 7.5% if the quantity ordered is 400 units or
more. The rate of discount will increase to 12.5%, if the order is for 3000 units or
more. Find out the economic order quantity.
3. A retailer gets discount for large orders. The discount is 4% if the quantity ordered is
500 or more, and an additional 1% discount is received if the quantity ordered is
1,000 or more. The product costs Rs.50 and sells uniformly at the rate of 25,000 units
a year. The fixed order cost is Rs.50, while the inventory carrying cost is 20% of the
value of the average inventory held.
a. What is the best order quantity?
b. What is the minimum total annual cost, including the purchasing cost?
4. A purchase manager has decided to place order for a minimum quantity of 500
numbers of a particular item in order to get a discount of 10%. From past records, it
was found out that in the last year, 8 orders each of size 200 units were placed. Given
the ordering cost equal to Rs.500 /order, inventory carrying cost of 40% of the
inventory value and the price of the item of Rs. 400/unit. Is the purchase manager
justified in his decision? What is the effect of his decision to the company?
5. A soft drinks manufacturing company buys a large number of pallets every year
which it uses in the warehousing of its bottled products. A local vendor has offered
the following discount schedule for pallets:
Order Quantity Unit price(Rs)
0 ≤ Q1 ≤ 699 10.00
700 and above 9.25
The average yearly replacement is 2400 pallets. The carrying cost is 12% of the
average inventory and ordering cost /order is Rs.100. find out the optimum order
quantity.
UNIT V
1. A project consist of a series of task labeled A,B, ….H,I with the following
relationship (W<X,Y means X and Y cannot start until W is completed; X, Y < W
means W cannot start until both X and Y are completed). With this notation
construct the network diagram having the following constraints:
A<D, E B,D<F C<G B,G<H F,G<I
Find also the minimum time of completion of the project, when the time (in days)
of completion of each task is as follows:
Task: A B C D E F G H I
Time: 23 8 20 16 24 18 19 4 10
2. A small project consists of seven activities for which the relevant data are given
below:
Activity Preceding Activities Activity duration(days)
A - 4
B - 7
C - 6
D A,B 5
E A,B 7
F C,D,E 6
G C,D,E 5
a. Draw the network and find the project completion time
b. Calculate total float for each of the activities and highlight the critical path.
3. Given the following information:
Activity : 0-1 1-2 1-3 2-4 2-5 3-4 3-6 4-7 5-7 6-7
Duration 2 8 10 6 3 3 7 5 2 8
(in days):
a. Draw the arrow diagram
b. Identify the critical path and find the total project duration
4. A project consists of eight activities with the following relevant information: