Iitkgp or Papers

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

Department of Industrial & Systems Engineering

Indian Institute of Technology Kharagpur


End-Semester Examination - Spring 2016
Operations Research (IM41082)
Time: 3 Hrs (Attempt ALL questions) Full Mark: 50
Note: State your assumptions clearly

Question 1 [2+1+3+3+1]
CU-Miner, a copper manufacturer, produces three different types of product: wire (A), disc (B) and bar (C).
Two different raw materials are required for the production Rl (ore) and R2 (cleaner). Each kg production of
A, Band C requires lA, 1.5 and 1.6 kg ofR1, respectively. Raw material R2 requirement is 1 kg,2 kg and 3 kg
for each kg of products A, B, and C, respectively. Total available Rl and R2 are 2000 kg and 900 kg,
respectively. Two operations are required Op1 and Op2 on two different machines for the final products. Time
needed/kg and total available time
ti CIII hours ) are given
. . tl1e t a bl e b eow:
III 1
A B C Available
Op 1 4 6 10 3600
Op2 3 4 7 3000

The selling price per kg for product A is ~ 100, and for Band C are ~ 90.
(a) Write the LP formulation and solve using the concept of revised simplex (Matrix form).
(b) Is there any redundant constraint in the problem? If yes, identify and explain.
(c) Another home appliance company HOMEDIVINE wants to buy products A and B only. What should be
the minimum price he should offer to CU-Miner such that it will produce only A and B and sell to
HOMEDIVE? (Assume only Integer price)
(d) A Cu- pots maker POTTERY is interested in buying products Band C only. How much minimum price
he should offer to Band C such that Cu-Miner wiII only manufacture Band C? (Assume only Integer
price)
(e) Which of the offers (out of c and d) will be lucrative for Cu-Miner?

Question 2 [6+4]
(a) Consider the following LP
Maximize Z = 8x, -9X2 + 12x3 +4X4 + 11x5
Subject to
2x, - 3x2 + 4X3 + x4 + 3X5 ~ 5
x, + 7x2 + 3x) - 2X4 + X5 ~ 3
5x, +4X2 -6X3 +2X4 +3X5 ~16
Xi:?: O,i = 1,2, ...,5
Use duality and complementary slackness theorem to find if(O, 2, 1, 7, 0) is the optimal solution.
(b) The setup time for each job on various machines is given by the following table. Find an optimal
assignment of jobs to machines such that the total setup time is minimized. Has the problem multiple
optimal solutions? Justify.
Machine
1 2 3
A 3 10 15
B 15 20 23
Job
C 15 20 23
D 21 25 27

Question 3 (Assume co/= 100) [4 +(3+3)]


(a) A telephone company, TELNET is planning to build new telephone boxes for a city. Initial survey shows
that approximately 100 persons per hour wants to make a phone call. Duration of the call is approximately
exponentially distributed with mean 1 minute. How many (minimum) such boxes is needed such that mean
waiting time is less than 15 seconds?

Page 1of2
-- --------------------------------,
(b) A computer consists of three processors and their main task (priority) is to execute jobs from users. These
jobs arrive according to the Poisson process with average rate 20 jobs per minute. The execution time at
each processor is exponentially distributed with mean 2 seconds. When any processor becomes idle (no
queue) it starts executing jobs from server till any job from user arrives. Assume server jobs are always
available and it takes 5 seconds to finish a server job. Also assume that unfinished server jobs can be stored
in the memory and can be resumed later, i.e. from the point where it was interrupted.
(i) Find how many server jobs will be completed in 30 minutes.
(ii) How many more server jobs will be finished in 30 minutes if processors are replaced, which takes 1 second.

Question 4 [2+2+3+3]
A manufacturing company produces three products (A, B, and C) using labor and material with the objective of
maximizing the total profit to determine the optimal production plan. The problem is formulated as the
following linear program.
Maximize Z = 3Xl + X2 + 5X3
Subject to:
6Xl + 3X2+ 5X3 ::; 45 (Labor)
3Xl + 4X2 + 5X3::; 30 (Material)
x., X2, X3~ 0
where XI, X2, and X3 are the amount of products A, B, and C. Let X4 and X5 be slack variables for labor and
material constraints, respectively. The optimal solution is given by the following tableau.
Basis Xl X2 X3 X4 X5 RHS
Xl 1 -113 0 113 -113 5
X3 0 1 1 -115 2/5 3
Zj-c 0 3 0 0 1 30
Using the procedure of sensitivity analysis, answer the following questions
(a) What should be the unit profit of Product B before it becomes worthwhile to manufacture?
(b) Suppose an additional 15 units of material may be obtained at a cost of $1 O. Is it profitable to do so?
(c) Find the optimal solution when the available material is increased to 60 units.
(d) Suppose a "supervision" constraint, x, + X2 + 3X3 ::; 18 is added to the original problem, find the new
optimal production plan.

Question 5 [(1+2+3)+4]
(a) A hospital needs to purchase 3 gallons of a perishable medicine for use during the current month and 4
gallons for use during the next month. Because the medicine is perishable, it can only be used during the
month of purchase. Two companies (X and Y) sell the medicine. The medicine is in short supply. Thus,
during the next two months, the hospital is limited to buying at most 5 gallons from each company. The
companies charge the prices shown in the following table.

Company Current month's price Next month's price


per gallon ($) per gallon ($)
X 800 720
Y 710 750
(i) Formulate a balanced transportation model in tabular form to minimize the cost of purchasing the
needed medicine.
(ii) Use Vogel's method to find a basic feasible solution for the problem
(iii) Use the transportation simplex to find the optimal buying strategy for the hospital.
(b) Consider the problem in which two factories supply three stores with a commodity. The number of supply
units available at source 1 and 2 are 200 and 300 units respectively. The demand at stores 1, 2, and 3 are
100,200 and 50 only. The units may be transshipped among the factories and the stores before reaching the
final destination. Set up the transportation table based on the following units costs.
Factory Store
1 2 2 3
0 6 7 8 9
Factory 2
6 0 5 4 3
1 7 2 0 5 1
Store 2 1 5 1 0 4
3 8 9 7 6 0

Page 2 0[2
INDIAN INSTITUTE OF TECHNOLOGY, KHARAGPUR
End-Term Examination- Autumn 2012
IM 41082: Operations Research
Time: 3 Hours Maximum Points: 60
Instructions:
1. Ensure that question paper has seven questions and a standard normal table on two printed sides.
2. State all your assumptions clearly and show all work neatly to obtain full or partial credit
Good Luck!
Question 1) (2+ 4+ 4 points) Question 3) (1+6+1+2 points)
A product is produced by four factories F1 , F2 , F3, and F4 . You have the responsibility to organize a rock concert at liT
Their unit production costs are INR 2, 3, 1, and 5 respectively. campus during Spring Fest. You must perform the tasks shown
Production capacities of the factories are 50, 70, 30 and 50 in table, before the concert can be held (Duration in days).
units respective~. The product is supplied to four a) Draw the project Network.
stores 51 , 52 , 53 , and 54 , the requirements of which are 25, b) Calculate slack for each activity.
35, 105, and 20 respectively. Unit costs of transportation are c) Determine the critical path.
given in the following table. The objective is to minimize the d) If you want to have a 99% chance of completing all
total cost (production and transportation). preparations by Jan 23, 2013, when should work
begin on finding a concert site?
5J 5z 53 51:
Fl 2 4 6 11 Activity Immediate 0 M P
Fz 10 8 7 5 Predecessors
F3 13 3 9 12 A 2 3 4
F1: 4 6 8 3 B A 1 2 3
c A 2 6 10
a) Formulate this problem as a transportation problem D c 1 2 3
by constructing the appropriate table. E A 1 3 5
b) Use the Vogel's approximation method to obtain an F B 2 3 4
initial BF solution for this problem. G c 3 5 7
c) Is initial BF solution obtained in part {b) optimal? If H c 0.5 1 1.5
yes, show why? If not, obtain optimal solution using I F,H 1 1.5 2
transportation algorithm. J I 1 2 3

Question 2) (2+4+4 points) Question 4) (3+3+1 points)


Suppose during winter break I am going for a trip to Consider a birth-and-death process with just three attainable
Disneyworld for 5 days. Each day I will go to a single theme states (0, 1, and 2), for which the steady-state probabilities are
park, and! want to visit all 5 parks. The average wait in lines at P0 , P1 , and P2 , respectively. The birth-and-death rates are
each park depends on the day of the week (Given in the table), summarized in the following table:
so I want to plan my visit to minimize my average wait time.
State Birth Rate(Au) Death Rate(&)
Mon Tue Wed Thur Fri 0 1
Magic Kingdom 24 33 30 35 37 1 1 2
Epcot 18 32 36 20 27 2 0 2
Hollywood Studios 30 40 27 25 27
Animal Kingdom 26 31 35 25 15 a) Construct the rate diagram for this birth-and-death
T~phoon Lagoon 24 25 34 28 32 process and develop the balance equations.
b) Solve these equations to find P0 , P11 and P2 . (Note:
a) Formulate a linear programming model for this Do not use the known formulas directly)
problem. c) Calculate L andW.
b) Solve the problem as an assignment problem. Make
sure to state which day is spent at each park. Question 5) (3 points)
c) Just a day before my trip to Disneyworld starts, I was You are given an M/M/1 queuing system in which the expected
informed that Animal Kingdom will be closed for waiting time and expected number in the system are 120
schedule maintenance on Friday. Does this minutes and 8 customers, respectively. Determine the
information affect my schedule? If yes, what should probability that a customer's service time exceeds 20 minutes.
be the new schedule? If no, explain why?

1
Question 6) (2+3+5 points)
A student joins liT Kharagpur for a 5 years dual degree Tables of the Normal Distribution
program in Cherr:istry. To commute inside the campus as well
outside he requires a bicycle all the time- he can't be without
one. Hence, he wants to determine the cheapest way to buy Probabilitv.. Content from -oo to Z
and maintain bicycle over the 5-year timeframe before finishing
z I o.oo 0.01 0.02 0.03 o.04 0.05 o.o6 0.07 0.08 o.o9
his studies here at liT. He has collected some information
about costs from senior students, bicycle shops and repair
----+---------------------------------------------------------------------
0.0 0.5000 0.5040 0.5080 0.5120 0.5160 0.51~9 0.5239 0.5279 0.5319 0.535
center. A new Hero bicycle cost INR 5000. Maintenance costs 0.1 0.5398 0.5438 0.5478 0.5517 0.5557 0.5596 0.5636 0.5675 0.5714 0.575
vary with the age qf the bike: INR 300 in the first year, INR 400 0.2 0.5793 0.5832 0.5871 0.5910 0.5948 0.5987 0.6026 0.6064 0.6103 0.614
in the second ye~[/INR 600 in the third year. Given the 0.3 0.6179 0.6217 0.6255 0.6293 0.6331 0.6368 0.6406 0.6443 0.6480 0.651
o.4 o.6554 o.6591 0.6628 0.6664 o.670o 0.6736 0.6772 0.6808 0.6844 o.6a7
amount of use they get, bicycles will last maximum of three
0. 5 0. 6915 0. 6950 0. 6985 0. 7019 0. 7054 0. 7088 0. 7123 0. 7157 0. 7190 0. 722
years before the{are sold. He figures that he can get INR 0.6 0.7257 0.72910.7324 0.7357 0.7389 0.7422 0.7454 0.7486 0.7517 0.754
4000 if he sells a~oicycle after one year of use, INR 3000 after 0.7 0.7580 0.7611 0.7642 0.7673 ·0.7704 0.7734 0.7764 0.7794 0.7823 0.785
two years of use and" INR 2500 after three years of use. He 0.8 0. 7881 o. 7910 0. 7939 o. 7967 o. 7995 0.8023 0.8051 0.8078 0.8106 0.813
has no bicycle at the moment. When should he buy bicycle 0.9 0.8159 0.8186 0.8212 0.8238 0.8264 0.8289 0.8315 0.8340 0.8365 0.838
1.0 0.8413 0.8438 0.8461 0.8485 0.8508 0.8531 0.8554 0.8577 0.8599 0.862
and how long should he keep to minimize his total costs over 1.1 0.8643 0.8665 0.8686 0.8708 0.8729 0.8749 0.8770 0.8790 0.8810 0.883
the 5-year timefrary1e? 1. 2 0. 8849 0. 8869 0. 8888 0. 8907 0. 8925 0. 8944 0. 8962 0. 8980 0. 6997 0. 901
a) Formulate a linear programming model for this 1.3 0.9032 0.9049 0.9066 0.9082 0.9099 0.9115 0.9131 0.9147 0.9162 0.917
problerr:. 1.4 0.9192 0.9207 0.9222 0.9236 0.9251 0.9265 0.9279 0.9292 0.9306 0.931
b) Formulate this problem as a shortest route model. 1.5 0.9332 0.9345 0,9357 0.9370 0.9382 0.9394 0.9406 0.9418 0.9429 0.944
1.6 I 0.9452 0.9463 0.9>74 0.9484 0.9495 0.9505 0.9515 0.9525 0.9535 0.954
Show thB resulting network diagram. 1.7 I 0.9554 0.9564 0.9573 0.9582 0.9591 0.9599 0.9608 0.9616 0.9625 0.963
c) Find thE:'optimum solution. 1.8 I 0.9641 0.9649 0.9656 0.9664 o.9671 0.9678 0.9686 0.9693 0.9699 0.970
1.9 0.9713 0.9719 0.9726 0.9732 0.9738 0.9744 0.9750 O.S756 0.9761 0.976
Bonus Question 7) (1+2+7 points) 2.0 0.9772 0.9178 0.9783 0.9788 0.9793 0.9798 0.9803 0.9608 0.9812 0.981
2.1 0.9821 0.9826 0.9830 0.9834 0.9838 0.9842 0.9846 0.9850 0.98~4 0.90~
Electro produces 15 electronic parts on 10 machines. The
2.2 0.9861 0.9864 0.9868 0.9871 0.9875 0.9878 0.9881 0.9884 0.9887 0.989
company wants to group the machine into cells designed to 2.3 0.9893 0.9896 0.9898 0.9901 0.9904 0.9906 0.9909 0.9911 0.9913 0.991
minimize the "dissimilarities" among the parts processed in 2.4 0.9918 0.9920 0.9922 0.9925 0.9927 0.9929 0.9931 0.9932 0.9934 0.993
each cell. A measure of "dissimilarities", dij, among the parts 2.5 0.9938 0.9940 0.9941 0.9943 0.9945 0.9946 0.9948 0.9949 0.9951 0.995
2.6 0.9953 0.9955 0.9956 0.9957 0.9959 0.9960 0.9961 0.9962 0.9963 0.996
processed on machine i and j can be expressed as 2.7 0.9965 0.9966 0.9967 0.9968 0.9969 0.9970 0.9971 0.9972 0.9973 0.997
. n··
J di. = 1- !} 2.8 0.9974 0.9915 0'.9976 0.9917 0.9977 0.9978 0.9979 0.9979 0.9980 0.998
1
nij + mij 2.9 0.9981 0.9982 0.9962 0.9983 0.9984 0.9984 0.9985 0.9985 0.9906 0.998
Where, nij is thE: number of parts shared between machines i 3.0 0.9987 0.9987 0.9987 0.9988 0.9988 0.9989 0.9989 0.9989 0.9990 0.999

and j, and mij is the number of parts that are used by either
machine i or machine j only.
The following table assigns the parts to machines: ------------------------XXX------------------------
Machine Assigned Parts
1 1,6
2 ·' 2, 3, 7, 8, 9, 12, 13, 15
3,rJi~ 3, 5, 10, 14
41lJ 2, 7, 8, 11, 12, 13
5,4
[,i
3 '
5' 10 ' 11 14 l

s:~ 1,4,5,9,10
7 .. ~ 2, 5,7, 8, 9, 10
8 3,4, 15
9 4, 10
~--~3~,8~·~10~,1~4~,1~5____
,.0 1~:
j· t

a) Expres:, the problem as a network model.


b) Show that the determination of the cells can be based
on the 9;1inimal spanning tree solution.
c) For the data given in the table, construct two- and
three-cell solutions

2
Department oflndustrial Engineering and Management
Indian Institute of Technology, Kharagpur
End-Semester Examination -Autumn 2011
Operations Research -1 (IM21003)
Time: 3 Hrs (Any missing data may be assumed suitably giving proper justification) Full Mark: 100
(Attempt any FIVE of the following questions. All the questions carry equal marks)

Question (1) [(4 + 4 + 2) + (4 + 4 + 2)]


(a) Consider the following transportation model. The numbers in the squares within each cell is the unit
transportation cost. The numbers encircled are the basic feasible solution.

25
15

® A3

® 20
40 30 B3

(i) If A3=52, B 3=42, and X 33 =2, is the given basic feasible solution optimal?
(ii) Write the primal and dual LP formulation for this problem and find the values of the primal and dual
variables (Assume values of A 3, B 3, and X 33 as above).
(iii) What values of A 3 and B3 give a degenerated basic feasible solution? Is this solution optimal? Is it
unique? If so suggest an alternate optimal solution.

(b) Consider the transportation problem in which two factories supply three stores with a commodity. The
number of supply units available at source 1 and 2 are 200 and 300 units respectively. The demand at stores ..::.
1, 2, and 3 are 100, 200 and 50 only. The units may be transshipped among the factories and the stores before
reaching the final destination. Set up the transportation table based on the following units costs. Find out a
basic feasible solution to the problem using Vogel's approximation method. Is the solution optimal?

Factory Store
1 2 2 3
1 0 6 7 8 9
Factory
2 6 0 5 4 3
1 7 2 0 5 1
Store 2 1 5 1 0 4
3 8 9 7 6 0

Question (2) [2 + 2 + (2 + 10 + 4)]


(a) While using Hungarian method, you keep modifying the assignment table. What is the justification that the
solution that you obtain in the modified table is the optimal solution to the original problem?'

(b) Is the solution obtained by Hungarian method is always a degenerated solution for the corresponding LP? If
yes, how many basic variables will have value zero? If no, explain under what circumstances it may be
degenerated.

(c) Consider the Travelling Salesman Problem (TSP) on the next page.
(i). Find out a tour and subtour for the problem. How many tours are possible?
(ii). Solve the problem using Branch and Bound (B&B) algorithm. Expand the B&B tree upto level two in a
breadth first manner. Write down the upper and lower bound of the solution at this stage.
(iii). What is the percentage of error that you may be making if you stop your iteration at this stage? What is
the current best solution?
Page 1 of3
Question (3) [(2 + 3 + 5) + (2 + 2 + 2 + 2 + 2))
(a) For the following integer programming problem
Min Z =1 0 xi+ 9xz
Subject to XI :S 8, xz:S 10, XI+ 3x2 ?: 45, land x~, x2 ?: 0, x2 is integer.
(i) Draw its solution space. Is it discrete or continuous? What is the .size of the search space?
(ii) Write down the fathoming rules used to cut the branches of the B&B tree.
(iii) Draw the B&B tree for this problem. If you are cutting any branch, mention the rule used to do so.

(b) Explain how these situations can be modeled using binary integer programming problems.
(i) Either x1+xz:S 2 or 2xi+3x2 ?: 8
(ii)Variable x2 can assume values-O, 5, 9, 12 only.
(iii)
If X<t :S 4 then x5 ?: 6, otherwise x5 :S 3
(iv)At least two of the following constraints must be satisfied.
X(;+ X7 :S 2,
X(; :s 1,
X7 :S 5,
X(;+X7?:3.
(v) You have to choose few products·to make an optimal product mix. Each product has a fixed setup cost
and a variable production cost proportional to the number of units produced. Assume N products and M
resources. Each product i is associated with fixed cost K;, variable cost C; and uses/h resource in au unit.
Each resource j has maximum b1 units available.

Question (4) [(4 + 6) + 10]


(a) The cost of transporting material from supply points A, B, C and D to demand points 1, 2, 3, 4 and 5 is given the
following table. The present allocation is as .follows: A to 1= 90, A to 2 = 10, B to 2 = 150, C to 2 = 10, ·c to 3 =
50, C to 5 = 120, D to 4 = 210, D to 5 = 70; Check if this allocation is optimum. If not, fmd an optimum
allocation.
1 2 3 4 5

A 8 10 12 17 15
B 15 13 18 n 9
c 14 20 6 10 13
D 13 19 7 5 12
'
'

(b) The Kolkata police have just received three calls for police. Five cars are available. The distance (in km) of
each car from each call is given in the table below. Kolkata police wants to minimize the total distance cars
must travel to respond to the three police calls. Use Hungarian method to determine which car should respond
to which call.
Distance (in km)
Car Call 1 Call2 Call3
1 10 11 18
2 6 7 7
3 7 8
4 5 6 4
5 9 4 7
Note: "-" indicates that the route is not available

Page 2 of3
----- · - - - -
/
Question (5) [10 + (3 + 7)]
(a) Because of excessive pollution in Jamuna River, the Delhi government is planning to build pollution control
stations. Three sites (1, 2, and 3) are under consideration. Government is interested in controlling the
pollution levels of two pollutants (1 and 2). It is desired that at least 80,000 tons of pollutant 1 and at least
50,000 tons of pollutant 2 be removed from the river. The relevant data for this problem are shown in below.
Formulate an IP to minimize the cost of meeting the government's objectives.

Cost of Cost of Treating Amount removed per ton of


Building 1 Ton water water
Site Station (Rs.) (Rs.) Pollutant 1 Pollutant 2
1 1,00,000 20 0.40 0.30
"2 60,000 30 0.25 0.20
3 ' 40,000 40 0.20 0.25

(b) Four projects are available for investment. The projects require the cash flows and yield the net present
values (NPV) (in millions) shown below. The maximum amount available for investment is $6 million at
time 0.

Cash outflow at
Project time 0 ($) NPV($)
1 3 5
2 5 8
3 2 3
4 4 7

(i) Formulate the problem as BIP problem.


(ii) Find the inyestment plan that maximizes NPV using branch and bound approach.

Question (6) [5 +10 + 5]


Consider the following problem.
Maximize Z == 8x, + 24x2,
subject to
x, + 2x2 ~ 10
2x 1 + x 2 ~ 10
and x 1 2: 0, x2 2: 0.
Suppose that Z represents profit and that it is possible to modify the objective function somewhat by an appropriate
shifting of key personnel between the two activities. In particular, suppose that the unit profit of activity 1 can be
increased above 8 (to a maximum of 18) at the expense of decreasing the unit profit of activity 2 below 24 by twice
the amount. Thus, Z can actually be represented as
Z(8) == (8 + e )x, + (24 - 28)x2, where e is also a decision variable such that 0 ~ 8 ~ 10.

(a) Solve the original form of this problem graphically. Then obtain the final simplex tableau using the graphical
solution.

(b) Use parametric linear programming to find an optimal solution and the optimal value of Z(8) as a function of e,
for 0 ~ e ~ 10.

(c) Plot Z(8) (do not use graph paper). Determine the optimal value of e.

Page 3 of3
Department of Industrial Engineering and Management
Indian Institute of Technology, Kharagpur
End Semester Examination, April2012 (Spring)
Sub: Operations Research (Sub No. IM41082)
Time: 3 hours Max Marks: 50
Answer;any FIVE questions.

Question 1 [10]
(a) A State University can store 200 files on hard disk, 100 files in computer memory, and 300
files on tape. Users want to store 300 word-processing files, I 00 packaged-program files, and
100 data files. Each month a typical word-processing file is accessed eight times; a typical
packaged-program file, four times; and a typical data file, two times. When a file is accessed,
the time it takes for the file to be retrieved depends on the type of file and on the storage
medium (see Table below). '
~--~----,,-,~-~"-,c,--~j~~.- . . (M_f_t__
) _____
:·,••. :;~:,,.' :: •• ·.2r" :. ""e .... nu es
·.
storii~e':c;. ,c,_ " .:~:t;i,wn···:.· : .·:~~~~,'v,,Pack~litnt
Melllum/ ,. , ~nieessl •,; . . Program Data
Hard disk 5 4 4
Memory 2
Tape 10 8 6

(i) If the goal is to minimize the tot"U time per month that users spend accessing their files,
formulate a balanced transportation problem in tabular form that can be used to determine
where files should be stored. I
(ii) Use the least cost method to find a basic feasible solution.
(iii) Use the transportation simplex to find an optimal solution.
(b) Explain why the transportation siq1plex is not appropriate for solving the assignment
problem?

Question 2 [10]
(a) A museum has four valuable paintings that are up for sale. Four customers are bidding for the
paintings. Customer 1 is willing to buy two paintings, but each other customer is willing to
purchase at most one painting. The prices that each customer is willing to pay are given in
the following Table.
----------------------------------
($) Bid for
Customer Painting 1 Painting2 Painting 3 Painting 4
1 8 11
2 9 13 12 7
3 9 11
4 12 9

(i) Formulate the problem as a balanced assignment problem.


(ii) Use the Hungarian method to maximize the total revenue received from the sale of the
paintings.
Page 1 of4
(b) Consider the transportation problem in which two factories supply three stores with a
commodity. The number of supply units available at factories 1 and 2 are 200 and 300 units
respectively. The demand at stores 1, 2, and 3 are 100, 200 and 50 only. The units may be
transshipped among the factories and the stores before reaching the (lnal destination. Set up
the transportation table based on the following units costs. Find out initial basic feasible
solution to the problem using Vogel's approximation method.

Factory Store
1 2 1 2 3
1 0 6 7 8 9
Factory
2 6 0 5 4 3
1 7 2 0 5 1
Store 2 1 5 1 0 4
3 8 9 7 6 0

Question 3 [10]
(a) Consider the following problem.
Maximize Z = 3x1 + x2 + 4x3
S.t. 6x1 + 3x2 + 5x3 ~ 25
3x1 + 4x2 + 5x3
20 ~
and XpX2 ,x3 ;::: 0
The corresponding final optimal equations are:
Z +2x2 +115x4 +315x5 =17
x1 -II 3x2 + 113x4 -113x5 = 5 I 3
x2 + x3 -115x4 + 2 I 5x5 = 3
Where x 4 and x 5 are the slack variables for the respective functional constraints. Investigate the
following changes to indicate whether the current solution remains (i) feasible, and (ii) optimal.
DO NOT REOPTIMIZEIRESOL VE
(i) Changing the RHS of constraint 2 to b2 = 5.
(ii) Changing the coefficient of x2 in the objective function to c2 = 4.
(iii)Changing the coefficient ofx3 in the objective function to c3 = 3.
(iv)Changing the coefficient ofx2 in constraint 2 to a22 = 1.
(b) Use the dual simplex method to solve the following LP:
Maximize Z = - 2x1 - X 3
S.t. x1 +x 2 -x 3 ~5

x 1 - 2x 2 + 4x3 ~ 8 and XpX 2 ,x3 ~ 0

Question 4 [10]
(a) Consider the following primal linear programming problem:
Maximize Z = X1 + 2x2 + X3
S. t. X! + X2 - X3 :'S 2
XJ-X2 +X3 = 1
2x1 + X2 + X3 ~ 2
x1 ~ 0, x2 :S 0, X3 unrestricted in sign

Page 2 of4
(i) Write the dual of the problem.
(ii) Prove using the duality theory that the maximum value of Z for the primal problem
cannot exceed 1.
(b) Consider the following problem
Minimize Z = 2xt + 1Sx2 + Sx~ + 6x4
s.t. Xt + 6x2+3x3 + X42: 2
-2x1 + 5x2-X3 + 3x4~-3
X], X2, X3, X4 2: 0
(i) Write the dual ofthe problem.
(ii) Solve the dual graphically.
(iii)Utilize information about the dual problem and the theorems of duality to solve the
primal problem.

Question 5 [10]
A project consists of nine activities whose time estimates (in weeks) and the precedence
relationships are given below.

Activity Preceding Time estimatesJin weeksl


activity O_ptimistic time Most likely time Pessimistic time
A - 2 4 6
B - 6 6 6
c - 6 12 24
D A 2 5 8
E A 11 14 23
F B,D 8 10 12
<.
G B,D 3 6 9
H C,F 9 15 27
I E 4 10 16

(i) Draw the network diagram, and find the earliest start time, earliest finish time, latest start
time and latest finish time for all the activities. I -
(ii) Identify the critical path.
(iii) List the activities that could be delayed without affecting the expected project
completion time.
(iv) What is the project completion time and its variance?
(v) If the project is required to be completed by December 31 of a given year and the
manager wants to be 95% sure of meeting the dead line, when should he start the project
work.
(vi) A penalty of Rs. 15000 per week is to be imposed on the contractor if the project is not
completed in 36 weeks. What is the probability that he has to pay a penalty? A penalty of
45000?

Question 6 [10]
(a) An average of 10 cars per hour arrives at a single-server drive-in teller. Assume that the
average service time for each customer is 4 minutes, and both interarrival times and service
times are exponential. Answer the following questions:
(i) What is the probability that the teller is idle?
Page 3 of4
(ii) What is the average number of cars waiting in line for the teller? (A car that is being
served is not considered to be waiting in line.)
(iii)What is the average amount of time a drive-in customer spends in the bank parking lot
(including time in service)?
(iv)On the average, how many customers per hour will be served by the teller?
(b) The time between arrivals of buses follows an exponential distribution, with a mean of 60
minutes.
(i) What is the probability that exactly four buses will arrive during the next 2 hours?
(ii) That at least two buses will arrive during the next 2 hours?
(iii)That no buses will arrive during the next 2 hours?
(iv)A bus has just arrived. What is the probability that it will be between 30 and 90 minutes
before the next bus arrives?

Table: Standard Normal Cumulative Distribution Function (area under the standard normal
distribution from -oo to Z)
:z 0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08' 0.09
0.0 0.5000 0.5040 0.5080 0.5120 0.5160 0.5199 0.5239 0.5279 0.5319 0.5359
0.1 0.5398 0.5438 0.5478 0.5517 0.5557 0.5596 0.5636 0.5675 0.5714 0.5753
0.2 0.5793 0.5832 0.5871 0.5910 0.5948 0.5987 0.6026 0.6064 0.6103 0.6141
0.3 0.6179 0.6217 0.6255 0.6293 0.6331 0.6368 0.6408 0.6443 0.6480 0.6517
0.4 0.6554 0.6591 0.6628 0.6664 0.6700 0.6736 0.6772 0.6808 0.6844 0.6879

o.o 0.6915 0.6950 0.6985 0.7019 0.7054 0.7088 0.7123 0.7157 0.7190 0.7224
o.a 0.7257 0.7291 0.7324 0.7357 0.7389 0.7422 0.7454 0.7486 0.7517 0.7549
0.7 0.7580 0.7611 0.7642 0.7673 0.7704 0.7734 0.7764 0.7794 0.7823 0.7852
0.8 0.7881 0.7910 0.7939 0.7967 0.7995 0.8023 0.8051 0.8078 0.8106 0.8133
0.9 0.8159 0.8186 0.8212 0.8238 0.8264 0.8289 0.8315 0.8340 0.8365 0.8389

1.0 0"8413 0.8438 0.8461 0.8485 0. 8508 0.8531 0.8554 0.8577 0.8599 0.8621
1.1 0.8643 0.8665 0. 8686 0.8708 0.8729 0.8749 0.6770 0.8790 0.8810 0.8830
12 0.8849 0.8869 0.8888 0.8907 0.8925 0.8944 0.8962 0.8980 0.8997. 0.9015
1.3 0.9032 0.9049 0.9066 0.9082 0. 9099 0.9115 0.9131 0.9147 0.916? 0.9177
1.4 0.9192 0.9207 0.9222 0.9236 0.9251 0.9265 0.9279 0.9292 0.930$ 0.9319

1.5 0.9332 0.9345 0.9357 0.9370 0.9382 0.9394 0.9406 0.9418 0.9429 0.9441
1.6 0.9452 0.9463 0.9474 0.9484 0.9495 0.9505 0.9515 0.9525 0.9535 0.9545
1.7 0.9554 0.9564 0.9573 0.9582 0.9591 0.9599 0.9608 0.9616 0.9625 0.9633
1.8 0.9641 0.9649 0.9656 0.9664 0.9671 0.9678 0.9686 0.9693 0.9699 0.9706
1.9 0.9713 0.9719 0.9726 0.9732 0.9738 0.9744 0.9750 0.9756 0.9761 0.9767

2.0 0.9772 0.9778 0.9783 0.9788 0.9793 0.9798 0.9803 0.9808 0.9812 0.9817
2.1 0.9821 0.9826 0.9830 0.9834 0.9838 0.9842 0.9846 0.9850 0.9854 0.9857
2.2 Q.9861 0.9864 0.9868 0.9871 0.9875 0.9878 0.9881 0.9884 0.9887 0.9890
2.3 0.9893 0.9896 0.9898 0.9901 0.9904 0.9906 0.9909 0.9911 0.9913 0.9916
2.4 0.9918 0.9920 0.9922 0.9925 0.9927 0.9929 0.9931 0.9932 0.9934 0.9936

Page 4 of4
Department of Industrial Engineering and Management,
Indian institute of Technology Kharagpur
End-Semester Examination -Spring 2013
Operations Research (IM41082)
Time: 3 Hrs (Attempt any five questions including the last) Full Mark: 50

Question 1 (3+3+2+2)
We have three reservoirs (1-3) with daily supplies of 15, 20, 25 million liters offresh water respectively.
On each day we must supply four cities A, B, C, and D whose demands are 8, 10, 12, and 15,
respectively. The extra water from the reservoirs can be disposed without any additional cost. The cost of
pumping per millions of liter is given below:

Cities
A B c D
...""
·a 2 3 4 5
c
<!) 2 3 2 5 2
<fl
<!)
~ 3 4 2 3

a) The management decides not to use the pumping facility at reservoir 1, as sufficient water is available
from the other two reservoirs. Do you agree with the management's decision? Justify your answer.
b) Write down the LP formulation for the above problem. Find out the- values of the basic variables
when the solution is optimal.
c) Write down the dual of this problem and find out values ofthe dual variables.
d) Describe the physical significance of primal and dual variable in this context.

Question 2 (5+5)
a) Consider the following transshipment problem. Numbers associated with the intermediate links are
the cost of transportation. Setup the transportation table to solve this problem. Find the initial BFS
using Vogels' approximation method.

Sources Transshipment Nodes 6 Destinations


100 Tl
200

:>-. "0
0.. 5 s::
0..
='
V'J
""
E
<I)

150 2 8 300

b) A shop needs to assign 4 jobs to 4 workers. The cost of performing ajob is a function of the skill of
the worker. Worker I cannot do Job 3 and worker 3 cannot do job 4. Determine the optimal
assignment given the following cost of assignment table. Use Hungarian method.

Jobs
1 2 3 4
1 50 50 20
Worker 2 70 40 20 30
3 90 30 50
4 70 20 60 70

Page 1 of3
Question 3 (2x5)
Draw the PERT Network for the following research project with the activity information given below.
The activity durations are in terms of days.

Activity Immediate Optimistic Most Pessimistic


Predecessors Time Likely Time
Time
A 3 5
B I 2 3
c A 3 5 13
D A,B 4 7 10
E C,D 2 3 4
F D I 4 13
G E 4 8 12
H E,F 6 13 14
I G 2 6 10
J H I I I
K I, J 9 10 17

a) Draw the project network. Find the critical path.


b) Determine the expected earliest and latest starting times of each activity.
c) Determine the expected project completion time and variance of project duration.
~ _,d) lfthe project,manager~wants to be.98%.sure. that the.projecLis completed:.on the scheduled date,.how,.
many days before that date should he start the project?
e) The scheduled completion day of the project is Feb 5. If the project starts on Jan 1, find the
probability that the project will be completed latest by the scheduled date.

Question 4 (6+4)
a) A tax consulting firm has three counters in its .office to receive people who have problems concerning
their income, wealth, and sales taxes. On the average, 48; persons arrive in an 8-hour day. Each taX
adviser spends 15 minutes on the average on an arrival. If the arrivals are Poisson distributed and
service times are according to exponential distribution, find:
(i) The average number of customers in the system.
(ii) Average number of customers waiting to be serviced.
(iii) Average waitjng time for a customer.
(iv) The number of hours each week a tax adviser spends performing his job.
(v) The probabilitythat a customer has to wait before he _gets service.
(vi) The expected number of idle advisor at any specified, time.
b) Jobs arrive at a machine shop according to Poisson distribution at the rate of 80 jobs per week. An
automatic machine presents the bottleneck in the shop. It is estimated that a unit increase in the
production rate of the machine wilkost $250 per week. Delayed jobs normally result in lost business,
which is estimated to be $500 per job per week. Determin~ the associated optimum production rate
for the machine ba5ed on the given information.

Question 5 (5+5)
a) Consider the following LPP
Min Z = 4xl + 2x2- X3
S.t. x 1 + 2x2 :S 6
x 1 - x 2 + 2x3 = 8 and xl> x 2 ~ 0, x 3 unrestricted
(i) Find the dual of the problem.
(ii) Find the solution of the dual problem using graphical approach. Using the optimal solution of the
dual problem and Complementary Slackness Theorem, find the optimal solution for the original
problem.

Page 2 of3
b) In a 3x3 transportation problem, let xiJ be the amount shipped from source ito destinationj and let ciJ
be the corresponding transportation cost per unit. The amounts of supply at sources 1, 2, and 3 are 15,
30, and 85 units, respectively, and the demands at destinations 1, 2, and 3 are 20, 30, and 80 units,
respectively. Assume that the starting northwest-comer solution is optimal and that the associated
values of the dual variables are given as u 1 = -2, u2 = 3, U3 = 5, v1= 2, v2 = 5, and v3 = 10.
(i) Find the associated optimal cost.
(ii) Determine the smallest value of ciJ for each nonbasic variable that will maintain the optimality of
the northwest-comer solution.

Question 6 {2X5 2 any five}


(i) While solving assignment problem by Hungarian method you keep on modifying the cost matrix.
Prove that the optimal assignment obtained from this modified cost matrix is also optimal in the
context of the original cost matrix.
(ii) State the physical meaning for memoryless property and show that exponential distribution
satisfies this condition.
(iii) Why project duration follows normal duration while activity duration follows beta distribution?
Explain.
(iv) Formulate the linear programming model for the project network given in question 3 to minimize
the expected project completion time.
(v) Show that in a process if the inter-arrival time follows exponential distribution, the arrival rate
follows Poisson distribution.
(vi) Why a feasible number of assignments obtained using Hungarian method is optimal also?
(vii) Show that-dual of the transportation problem has ·no unique solution even if the transportation
problem has unique solution.

Area under the standard Normal table


z .00 .01 .02 .03 .04 .OS .06 .07 .08 .09

.0 .5000 .5040 .5080 .5120 .5160 .5199 .5239 .5279 .5319 .5359
.1 .5398 .5438 .5478 .5517 .5557 .5596 .5636 .5675 .5714 .5753
.2 .5793 .5832 .5871 .5910 .5948 .5987 .6026 .6064 .6103 .6141
.3 .6179 .6217 .6255 .6293 .6331 .6368 .6406 .6443 .6480 .6517
.4 .6554 .6591 .6628 .6664 .6700 .6736 .6772 .6808 .6844 .6879
.5 .6915 .6950 .6985 .7019 .7054 .7088 .7123 .7157 .7190 .7224
.6 .7257 .7291 .7324 .7357 .7389 .7422 .7454 .7486 .7517 .7549
.7
.8
.9
.7580
.7881
.8159
.7611
.7910
.8186
.7642
.7939
.8212
.7673
.7967
.8238
.7704
.7995
.8264
.7734
.8023
.8289
.7764
.8051
.8315
.7794
.8078
.8340
.7823
.8106
.8365
.7852
.8133
.8389
F(z) =--
1
Je-
c)21 dt
z 2

1.0
1.1
.8413
.8643
.8438
.8665
.8461
.8686
.8485
.8708
.8508
.8729
.8531
.8749
.8554
.8770
.8577
.8790
.8599
.8810
.8621
.8830
.J2; -OJ

1.2 .8849 .8869 .8888 .8907 .8925 .8944 .8962 .8980 .8997 .9015
1.3 .9032 .9049 .9066 .9082 .9099 .9115 .9131 .9147 .9162 .9177
1.4 .9192 .9207 .9222 .9236 .9251 .9265 .9279 .9292 .9306 .9319
1.5 .9332 .9345 .9357 .9370 .9382 .9394 .9406 .9418 .9429 .9441
1.6 .9452 .9463 .9474 .9484 .9495 .9505 .9515 .9525 .9535 .9545
1.7 .9554 .9564 .9573 .9582 .9591 .9599 .9608 .9616 .9625 .9633
1.8 .9641 .9649 .9656 .9664 .9671 .9678 .9686 .9693 .9699 .9706
1.9 .9713 .9719 .9726 .9732 .9738 .9744 .9750 .9756 .9761 .9767
2.0 .9772 .9778 .9783 .9788 .9793 .9798 .9803 .9808 .9812 .9817
2.1 .9821 .9826 .9830 .9834 .9838 .9842 .9846 .9850 .9854 .9857
2.2 .9861 .9864 .9868 .9871 .9875 .9878 .9881 .9884 .9887 .9890
2.3 .9893 .9896 .9898 .9901 .9904 .9906 .9909 .9911 .9913 .9916
2.4 .9918 .9920 .9922 .9925 .9927 .9929 .9931 .9932 .9934 .9936
2.5 .9938 .9940 .9941 .9943 .9945 .9946 .9948 .9949 .9951 .9952
2.6 .9953 .9955 .9956 .9957 .9959 .9960 .9961 .9962 .9963 .9964
2.7 .9965 .9966 .9967 .9968 .9969 .9970 .9971 .9972 .9973 .9974
2.8 .9974 .9975 .9976 .9977 .9977 .9978 .9979 .9979 .9980 .9981
2.9 .9981 .9982 .9982 .9983 .9984 .9984 .9985 .9985 .9986 .9986
3.0 .9987 .9987 .9987 .9988 .9988 .9989 .9989 .9989 .9990 .9990

Page 3 of3
Scanned by CamScanner
Scanned by CamScanner

You might also like