Operation Research Assignment 2
Operation Research Assignment 2
Q1. Define: (i) competitive game, (ii) payoff matrix, (iii) pure and mixed strategies, (iv) saddle
point, (v) optimal strategies, and (vi) rectangular (or two-person zero-sum) game (vii) Payoff
matrix. viii) value of game
Q2. Explain: Minimax and Maximin principle used in the theory of games.
Q3. What is a game in game theory? What are the assumptions made in the theory of games?
Q4. Solve the game whose payoff matrix is given below:
Q13. Solve the game with the following pay-off matrix for firm A:
Sequencing Problem
Q1. What do you understand by sequencing problem and total elapsed time on machine? Explain
the principal assumptions made while dealing with sequencing problems.
Q2. Explain the four elements that characterize a sequencing problem.
Q3. A book binder has one printing press, one binding machine and manuscripts of 7 different
books. The times required for performing printing and binding operations for different books are
shown below:
Decide the optimum sequence of processing of books in order to minimize the total time required
to bring out all the books.
Q4. There are seven jobs, each of which has to go through the machines A and B in the order
AB. Processing times in hours are as follows:
Determine a sequence of these jobs that will minimize the total elapsed time T. Also find T and
idle time for machines A and B.
Q.5. Find the sequence that minimizes the total elapsed time required to complete the following
tasks on two machines:
Q.6. We have five jobs, each of which must be processed on the two machines A and B in the
order AB. Processing times in hours are given in the table below:
Q7. Find the sequence that minimizes the total time required in performing the following jobs
on three machines in the order ABC. Processing times (in hours) are given in the following table:
Q8. Find the sequence that minimizes the total elapsed time required to complete the following
tasks. Each job is processed in the order ABC.
Q9. A machine operator has to perform three operations, turning, threading and knurling on a
number of different jobs. The time required to perform these operations (in minutes) for each job
is known and is give below:
Determine the order in which the jobs should be processed in order to minimize the total time
required to turn out all the jobs.
Q10. We have 5 jobs each of which must go through the machines A, B and C in the order ABC.
Processing times (in hours) is as follows:
Q11. Find an optimal sequence for the following sequencing problem of four jobs and five
machines (when passing is not allowed) of which processing time (in hrs) is as follows.
Q12. A company has to process five items on three machines A, B and C. Processing times are
given in the following table:
Q14. There are nine jobs, each of which must go through two machines P and Q in the order PQ,
the processing times (in hours) are given below:
MODI METHOD
Q1. Find an optimal sequence for the following sequencing problem of four jobs and five
machines when passing is not allowed, of which processing time (in hours) is given below:
Q2. A manufacturer wants to ship 22 loads of his product as shown below. The matrix gives the
kilometres from sources of supply to the destinations.
The shipping cost is Rs 10 per load per km. What shipping schedule should be used in order to
minimize the total transportation cost?
Q13. Goods have to be transported from sources S1, S2 and S3 to destinations D1, D2 and D3.
The transportation cost per unit, capacities of the sources, and the requirements of the
destinations are given in the following table.
Q4. The ABT transport company ships truckloads of food grains from three sources viz. X, Y, Z
to four mills viz. A, B, C, D respectively. The supply and the demand together with the unit
transportation cost per truckload on the different routes are described in the following
transportation table. Assume that the unit transportation costs are in hundreds of dollars.
Determine the optimum minimum shipment cost of transportation using MODI method.