1. L.P.P. BY GRAPHICAL METHOD 6. A firm makes product X and Y has total production capacity of 9 tons per day.

X and Y requires same production capacity. The firm has permanent contact to
1. A manufacturer manufactures two products A and B on which the profit
supply at least 2 tons of X and at least 3 tons of Y to another company. Each ton
earned per unit are Rs.3 and Rs.4 respectively. Each product is processed on two
of X requires 20 machines hours production time and each ton of Y requires 50
machines M1 and M2. Product A requires one minute of processing time on M1
machine hours of production time. Maximum possible machine house per day
and two minutes on M2 while B requires one minute on M1 and two minute on
are 360. All of firms output can be sold and the profit made is Rs.80 per ton of
M2. Machine M1 is available for not more than 7 hours , 30 minute while
X and Rs.120 per ton of Y. Determine production schedule for maximum profit
machine M2 is available for not more than 10 hours during any working day.
by graphical method. (W-08, S-09,10,17,18)
Find the number of units of products A and B to be manufactured to get
maximize profit. 7. A manufacture produces two types of products X and Y. Both the products
go through the machine M1 and M2. Products X requires 2 hours of M1 and 1
2. Find the maximum value of : Z= 2x1 + 3x2
hour of M2. Product Y required one hour of M1 and two hours of M2. M1 has
Subject to : x1 + x2 ≤ 30 , x2 ≥ 3 , x2 ≤ 12 , 0 ≤ x1 ≤ 20 104 hours and M2 has 76 hours available each month. Profit of one unit of
product X is Rs.6 and product Y is Rs.11. Assuming that all that is produced can
3. Find the maximum value of : Z= 5x1 + 2x2 be solved , how many unit of each product should be manufactured to maximize
Subject to : 2 x1 + 3x2 ≥ 1 and x1 , x2 ≥ 0 profit. (W-09)

4. Find the minimize Z= 6x1 + 4x2 8. An advertising agency wishes to reach two types of audiences: Customers
with annual income greater than one lakh rupees (target audience A) and
Subject to constraints : 15x1 + 15x2 ≥ 200 30x1 + 10x2 ≥ 400 customers with annual income of less than one lakh rupees (target audience B).
20x1 + 50x2 ≥ 440 x1 , x2 ≥ 0 The total advertising budget is Rs. 2,00,000. One program of TV advertising cost
of Rs. 50,000 ; One program of radio advertising cost of Rs. 20,000. For contact
5. A firm use lathe , milling machine and grinding machine to produce two reason, at least three programs ought to be on TV and the number of radio
machine parts. Table represent the machine time required for each part , the programs must be limited to 5. Survey indicate that single TV program reaches
machine time available on different machine and the profit on each machine 4,50,000 prospective customers in target audience A and 50,000 in target
part. audience B. One radio program reaches 20,000 prospective customers in target
audience A and 80,000 in target audience B. Determine media mix linear
Types of machines Machining Time Maximum Time
programing problem by graphical method to maximize the total reach. (S-12)
Required for the Available per week
machine part (minutes) (minutes) 9. The manufacture of patent medicines is proposed to prepare a production
plan for medicines A and B. there are sufficient ingredients available to make
I II 20,000 bottles of medicine A and 40,000 bottles of medicine B, But there are
Lathe m/c 12 6 3000 only 45,000 bottles into which either of the medicine can be filed. Further it
Milling m/c 4 10 2000
takes three hours to prepare enough material to fill 1000 bottles of medicine A
Grinding m/c 2 3 900
and one hour to prepare enough material to fill 1000 bottles of medicine B and
Profit/unit Rs.40 Rs.100
there are 66 hours available for this operation. The profit is Rs.8 per bottle for
Find the number of parts I and II to be manufactured per week to maximize
medicine A and Rs.7 per bottle for medicine B.
the profit. (W-11)
(i) Formulate problem as an LPP How should the manufacture schedule his production in order to maximize
contribution. (W-17)
(ii) How will the manufacture schedule his production in order to maximize
profit. (W-12) 15. Maximize Z = 2x1 + 4x2 (S-16)
Subject to constraints : 2x1 + x2 ≤ 18 3x1 +2x2 ≥ 30
10. Minimize Z = 20x1 + 40x2 (S-19)
x1 + 2x2 =25 x1 x2 ≥ 0
Subject to constraints : 36x1 + 6x2 ≥ 108 3x1 +12x2 ≥ 36
20x1 + 10x2 ≥100 x1 x2 ≥ 0 16. Minimize Z = 3x1 + 2x2 (S-19)
11. Maximize Z = – x1 + 2x2 (W-17) Subject to constraints : 5x1 + x2 ≥ 10 x1 + x2 ≥ 6
Subject to constraints : x1 − x2 ≤ -1 , - 0.5 𝑥1 + 𝑥2 ≤ 2 , x1 x2 ≥ 0 x1 + 4x2 ≥12 x1 x2 ≤ 0
17. The manager of an oil refinery must decide on the optimal mix of two
12. Minimize Z = 20x1 + 10x2 (W-18) possible blending processes of which the inputs and outputs per production run
Subject to constraints : x1 + 2x2 ≤ 40 3x1 + x2 ≥ 30 are as follows :
4x1 + 3x2 ≥ 60 x1 x2 ≥ 0 Processes Unit Input Unit Output Unit

13. An advertising agency wishes to reach two types of audiences: Customers Crude A Crude B Gasoline X Gasoline Y
with annual income greater than Rs.15000 (target audience A) and customers 1. 5 3 5 8
with annual income of less than Rs.15000 (target audience B). The total 2. 4 5 4 4
advertising budget is Rs. 2,00,000. One program of TV advertising cost of Rs. The maximum amounts available of crude A and crude B are 200 units and 150
50,000 ; One program of radio advertising cost of Rs. 20,000. For contact reason, units respectively. Market requirements show that at least 100 units of Gasoline
at least three programs ought to be on TV and the number of radio programs X and 80 units of Gasoline Y must be produced. The profit per production run
must be limited to 5. Survey indicate that single TV program reaches 4,50,000 for process 1 and process 2 are Rs. 300 and Rs. 400 respectively. Formulate LP
prospective customers in target audience A and 50,000 in target audience B. problem and solve by using graphical method. (S-18)
One radio program reaches 20,000 prospective customers in target audience A
and 80,000 in target audience B. Determine media mix linear programing 18. A company has two steel unit A and B, which have different production
problem by graphical method to maximize the total reach. capacity for high, medium and low carbon steel. This company has entered in a
contact of supply steels to a firm every week at least 120, 80 and 240 tonnes of
14. A firm makes two types of furniture chairs and tables. The contribution for high, medium and low carbon steel respectively. It cost the company Rs.24000
each product as calculated by the accounting department is Rs.20 per chair and and Rs.20000 per day to run this unit A and B respectively. In a day unit A
Rs.30 per table. Both products are processed on three machine M1, M2, M3. produces 60, 20 and 40 tonnes of high, medium and low carbon steel
The time required in hours by each product and total time available in hours per respectively. Unit B produce 20, 20 and 120 tonnes of high, medium and low
week on each machine are as fallows: carbon steel per day respectively. How many days per week should each unit be
operated in order to meet the order most economically.
Machine Time Required in Hours Quality Of Steel Unit A Unit B Production / Day
Chair Table Available Time High 60 20 120
M1 3 3 36 hrs/week Medium 20 20 80
M2 5 2 50 hrs/week Low 40 120 240
M3 2 6 60 hrs/week Solve by using graphical method. (S-03)
 2. OPERATION MODELS
Job Machines
(A) ASSIGNMENT MODEL : A B C D E
1 30 37 40 28 40
1. Five employees of a company are to be assigned to five jobs which can be
2 40 24 27 21 36
done by any of them. Because of different number of years with the firm, the
3 40 32 33 30 35
workers get different wages per hour. These are Rs.5 per hour of A, B and C each
4 25 38 40 36 36
& Rs.3 per hour for D and E. The amount of time taken by each employee to do 5 29 62 41 34 39
a job given below in given table:
Job Employee 4. A solicitors firm employees typists on hourly pieces rate basis for their daily
A B C D E work. There are five typists and their charges and speeds are different.
1 7 9 3 3 2 According to an earlier understanding only one job is given to one typist and the
2 6 1 6 6 5 typist is paid for full hour even if he works for a fraction of hour. Find the least
3 3 4 9 10 7 cost allocation for the following data: (W-07,17)
4 1 5 2 2 4 Typist Rate per No. of pages Job No. of pages
5 6 6 9 4 2 hour (Rs.) typed per
hour
Determine the assignment pattern that minimize the total time taken and A 5 12 P 199
minimize the total cost of getting five units of work done. (S-05) B 6 14 Q 175
C 3 8 R 145
2. Three buildings are to be added to the college campus. Bids the submitted by D 4 10 S 298
five contractors. The bids figures are given in million of rupees as shown in table. E 4 11 T 178
Find the assignment of building to contractors that cost of building programs.
(W-05) 5. A solicitors firm employees typists on hourly pieces rate basis for their daily
Contractors Building work. There are five typists and their charges and speeds are different.
A B C According to an earlier understanding only one job is given to one typist and the
1 2.90 1.62 - typist is paid for full hour even if he works for a fraction of hour. Find the least
2 3.10 1.75 2.81 cost allocation for the following data:
3 3.05 1.80 2.90 Typist Rate per No. of pages Job No. of pages
4 2.85 1.55 2.75 hour (Rs.) typed per
5 - 1.70 3.00 hour
A 5 12 P 200
3. Five different machines can do any of the five required job with different B 6 14 Q 176
profit from each assignment as shown in given table. Find out maximum profit C 3 8 R 150
possible to optimum assignment model. (S-07) D 4 10 S 300
E 4 11 T 180
6. A company has four territories open and four salesmen available for an The grade points are: H=10 , A=9 , B=8 , C=7 , D=6 , E=5 , F=4 . How will the
assignment. The territories are not equally rich in their sales potentials. It is student select the electives in order to maximize the total expected points and
estimated that a typical salesmen operating in each territory would bring in the what will be the maximum expected total points. (W-11)
following annual sales.
9. The owner of small machine shop has four machinist available for five jobs.
Territory I II III IV The jobs are offered to assign with the expected profit in hundred of Rs. For
Annual sales in Rs. 1,26,000 1,05,000 84,000 63,000 each machinist job being as follows. Find the assignment of job to machinist
The four salesmen also differ in the ability. It is estimated that, working under that will result in maximum profit. (-) indicate job machinist combination is not
the same condition, their yearly sales would be proportionally as follows: (S-06) possible. (S-12, W-14)

Salesmen A B C D A B C D E
proportion 7 5 5 4 1 6.2 7.8 - 10.1 8.2
2 7.0 8.4 6.5 7.5 6.0
3 8.7 9.2 11.1 7.0 8.2
7. A company has four territories open and four salesmen available for an
4 - 6.4 8.7 7.7 8.0
assignment. The territories are not equally rich in their sales potentials. It is
estimated that a typical salesmen operating in each territory would bring in the
following annual sales. 10. The department had five employee with five jobs to be performed . The time
(in hour) each man will take to perform each job is given in the effective matrix.
Territory I II III IV
Annual sales in Rs. 60,000 50,000 40,000 30,000 Job Employee
The four salesmen also differ in the ability. It is estimated that, working under I II III IV V
the same condition, their yearly sales would be proportionally as follows: (S-04) A 10 5 13 15 16
B 3 9 18 13 6
Salesmen A B C D C 10 7 2 2 2
proportion 7 5 5 4 D 7 11 9 7 12
E 7 9 10 4 12
8. A student has to select one and only one elective in each semester and same How should the job allocated , one per employee so as to minimize the total
elective should not selected in different semesters. Due to various reason the man hour. (S-14,19 W-18)
expected grades in each subject if selected in different semesters vary and a 11. A departmental head has four subordinates and four task to be performed.
given below: The subordinates differ in efficiency and the task differ in their intrinsic
Semester MQC Robotics Tool Auto. difficulty. His estimate of him each man would take a perform each task is given
design Engg below in the table. How should the tasks be allocated to subordinates so as to
I F E D C minimize the total man hours.
II E E C C
III C D C A
IV B A H H
 Subordinates Tasks C 50 48 40 60 50
I II III IV D 20 19 20 18 25
A 8 26 17 11 E 58 60 59 55 53
B 13 28 4 26 Make the assignment so that the expected total average runs scored by these
C 38 19 18 15 batsmen are maximum.
D 19 26 24 10
15. A RST Co. Ltd., has to work out the assignment of 5 different jobs on 5
different machines. The cost of machine per unit of job and set-up cost of job
12. The owner of small machine shop has four machinist available to assign a on a machine are as given in table. The jobs are to be made in batch size shown
job for the day, fine job are offered with expected profit for each machinist on against them. Set up cost is independent of previous set up decide optimal job
each job as follows: against.
Machinist Job (I) Operating cost (Rs.) of each machine for job/unit.
A B C D E
1 62 78 50 101 82 Machine Job
2 71 84 64 73 59 J1 J2 J3 J4 J5
3 87 92 111 71 81 M1 0.80 1.1 0.7 1.6 6.2
4 48 64 87 77 80 M2 1.20 0.9 1.2 0.8 5.4
Find the assignment of machinist to jobs that will result in maximum profit. M3 2.10 2.0 1.0 2.2 4.9
M4 - 1.6 2.0 1.9 3.6
13. Production cost of product P1 , P2 , P3 per unit manufactured on machine
M5 3.2 2.0 2.0 2.0 2.6
M1 , M2 , M3 , M4 is tabulated in the following table.
Batch 100 100 150 100 50
Product Machine size (unit)
M1 M2 M3 M4 (II) Set up cost (Rs.)
P1 40 50 30 25
P2 30 20 30 30 Machine Job
P3 30 35 25 35 J1 J2 J3 J4 J5
Selling price per unit for product P1 , P2 , P3 is Rs.70 , Rs.85 , Rs.60 respectively. M1 60 70 70 30 40
M2 40 50 50 20 80
Decide product machine combination for maximization of total profit.
M3 30 40 40 40 100
14. A captain of cricket team has to allot five middle betting positions to five M4 - 90 60 50 60
batsmen. The average run scored by each batsmen at these position are as M5 80 100 80 60 60
follows:

Batsmen Batting Position 16. A race hors owner has four hors named prince, Thunder, Raja, Diamond and
III IV V VI VII plans to enter them in four races. If he wishes to enter one hors in each race
A 40 40 35 25 50 and can-not enter any horse in more than one race , how should the enter them
B 42 30 16 25 27
so as to make his expected total purse winning as great as possible. The data is Customer Salesman
given in the table. S1 S2 S3 S4
C1 0.7 0.4 0.5 0.8
Horse Probability of winning C2 0.5 0.8 0.6 0.7
Race1 Race2 Race3 Race4 C3 0.3 0.9 0.6 0.2
Prince 0.40 0.30 0.20 0.80 If only one salesman is to be assigned to each of the customer what
Thunder 0.20 0.20 0.15 0.30 combination of salesman and customer shall be optimal , given further that the
Raja 0.15 0.10 0.00 0.20
profit obtained by selling one unit to C1 is Rs.500/- whereas it is respectively is
Diamond 0.10 0.00 0.00 0.20
Rs.450/- and Rs.540/-for sale C2 and C3 . What is expected profit.
purses Rs.5000/- Rs.7500/- Rs.25000/- Rs.40000/-
19. A MNC has taken third floor of multi storied building for rent with a view to
locate one of their zonal officer. There are five main rooms to be assigned to 5
17. A city corporation has decided to carry out road repairs on main four arteries
managers. Each room has its own advantage and disadvantage. Each of the 5
of the city. The government has agreed to make a special grant of Rs.50 lakhs
managers were asked to rank their rooms preferences , amongst the room 301,
toward the cost with a condition that the repair must be done at lowest cost
302, 303, 304, 305. There preferences given below:
and quickest time. If conditions warrant then a supplementary token grant will
also be considered favorably. The corporation has floated tenders and five Preference Manager
contractors have sent in their bids. In order to expedite work one road will be M1 M2 M3 M4 M5
awarded to only one contractor. 1 302 302 303 302 301
2 303 304 301 305 302
Contractor Road cost of repair in lakhs 3 304 305 304 304 304
R1 R2 R3 R4 4 - 301 305 303 -
C1 9 14 19 15 5 - - 302 - -
C2 7 17 20 19 Most of the managers did not list all the rooms since they were not satisfied
C3 9 18 21 18
with some of these rooms and they have left these rooms from the list.
C4 10 12 18 19
Assuming that their preferences can be quantified by numbers , find out which
C5 10 15 21 16
room should be assigned to which manager , so that their total preferences
(i) Find the best way assigning the repair work to the contractor and the costs.
ranking is minimum.
(ii) If it is necessary to seek supplementary grants what should be the amount
20. A company with a surplus truck in each of the cities A , B , C , D , E and one
sought ?
deficit truck in each of the cities 1 , 2 , 3 , 4 , 5 , 6. The distance between the
(iii) Which of the five contractors will be unsuccessful in their bid ? cities in kilometers is given in matrix below. Find the assignment of trucks from
cities in surplus to cities in deficit to minimize the total distance. (S-16)
18. A firm marketing air conditioners has four salesman S1 , S2 , S3 , S4 . There
are three customers to which a sale of a unit A.C each is to be made. The
chances of making a sales to a customer depend on the salesman customer
rapport. The table depicts the probability with which each of the salesman can
make a sales to each of the customers.
 1 2 3 4 5 6 23. XYZ airline operating seven days a week has given the following time table.
A 12 10 15 22 18 8 Crew must have minimum layover of 5 hours between flight. Obtain the
preparing of flights that minimize layover time away from home. For any given
B 10 18 25 15 16 12
pairing the crew will be based at the city that results in the smaller layover.
C 11 10 3 8 5 9 (W-12)
D 6 14 10 13 13 12
Chennai-Mumbai Mumbai-Chennai
E 8 12 11 7 13 10 Flight Depart. Arrival Flight Depart. Arrival
No. No.
A 6 am 8 am 1 8 am 10 am
21. An airline that operates between Delhi (A) and Kolkata (B) has the time table
B 8 am 10 am 2 9 am 11 am
as shown in the table. Crew must have minimum layover of 5 hours between
C 2 pm 4 pm 3 2 pm 4 pm
flight. Obtain the preparing of flights that minimize layover time away from D 8 pm 10 pm 4 7 pm 9 pm
home. Note that crew flying from A and B and back can be based either at A or
at B. For any given paring they will be based at the city that results in the smaller
layover. (W-06) 24. An airline that operates 7 days a week has the time table which is given
below. The crew must have a minimum layover time of five hours between
Flight Delhi-Kolkata Flight Kolkata-Delhi flights.
No. Departure Arrival No. Departure Arrival
1 6.00 am 7.00 am 101 8.00 am 9.15 am Delhi-Jaipur Jaipur-Delhi
2 7.30 am 8.30 am 102 9.00 am 10.15 am Flight Depart. Arrival Flight Depart. Arrival
3 10.30 am 11.30 am 103 11.30 am 00.45 pm No. No.
4 2.00 pm 3.00 pm 104 3.00 pm 4.15 pm 101 7.00 am 8.00 am 201 8.00 am 9.15 am
5 6.00 pm 7.00 pm 105 7.30 pm 8.45 pm 102 8.00 am 9.00 am 202 8.30 am 9.45 am
6 11.30 pm 00.30 am 106 10.00 pm 11.15 pm 103 1.30 pm 2.30 pm 203 12.00 pm 1.15 pm
104 6.30 pm 7.30 pm 204 5.30 pm 6.45 pm
Obtain the pairing of flights that minimize layover time away from home. For
22. An airline operates seven days a week and has following time table. The stop any given pairing the crew will be based at the city that results in the smaller
over cost is Rs.1000 per hour. Obtain paring the flights so that stop over cost is layout. For each pair also mention the town where the crew should be based.
minimum. For each pair specify home town for the crew. The crew must have a (S-15)
stop over time of at least 2 hours between the flight. (W-08)
Flight Mumbai-Nagpur Flight Nagpur-Mumbai 25. The flight timing between two cities X and Y are given. The minimum layover
No. Departure Arrival No. Departure Arrival time for crew in either city is two hours obtain.
101 7.00 am 9.00 am 201 8.00 am 9.00 am (i) Pairing of flights that minimize layover time away from non base cities and
102 8.00 am 10.00 am 202 8.15 am 10.30 am
103 1.30 pm 3.30 pm 203 12.00 pm 2.00 pm (ii) Base city of such crew. (W-18)
104 6.00 am 7.30 pm 204 5.00 pm 7.00 pm
 Flight X-Y Flight Y-X 28. A departmental head has four subordinates, and four task to be performed.
No. Depart. Arrival No. Depart Arrival The subordinates differ in efficiency, and the tasks differ in their intrinsic
101 5.00 am 6.15 am 201 6.30 am 7.30 am difficulty. His estimate, of the time each man would take to perform each task,
102 9.00 am 10.15 am 202 9.00 am 10.00 am is given in below :
103 1.00 pm 2.15 pm 203 3.30 pm 4.30 pm Task Men
104 6.00 pm 7.15 pm 204 10.00 pm 11.00 pm E F G H
A 18 26 17 11
B 13 28 14 26
26. A pharmaceutical company is producing a single product and is selling it C 38 19 18 15
through five agencies located in different cities. All of a sudden, there is a D 19 26 24 10
demand for the product in another five cities not having any agency of the How should the tasks be allocated, one to a man, so as to minimize the total
company. The company is faced with the problem of deciding on how to man-hours. (S-18)
dispatch the product to needy cities in such a way that the travelling distance is
minimized. The distance between the surplus and deficit cities (in km) is given 29. Production cost of products P1 , P2 , P3 per unit manufactured on machine
in the following table : (S-19) M1 , M2 , M3 and M4 are tabulated in the table. Sell price per unit is given as
P1= Rs.70 , P2=Rs.85 , P3=Rs.60. Describe the product machine combination for
Surplus Deficit Cities maximum of total profit:
Cities a b c d e
A 85 78 65 125 75 Product Machine
B 90 78 66 132 78 M1 M2 M3 M4
C 75 66 57 114 69 P1 40 50 30 25
D 80 72 60 120 72 P2 30 20 30 30
E 76 64 56 112 68 P3 30 35 25 35
Production cost matrix. (W-13)
27. A marketing manager has five salesmen and five sales districts. Considering
(B) TRAVELLING SALESMEN PROBLEM BY BRANCH BOUND TECHNIC :
the capabilities of the salesmen and the nature of districts, the marketing
manager estimates that sales per month (in hundred rupees) for each salesman 1. Solve the following traveling salesmen problem by branch bound method :
in each district would be as follows : (W-17) (W-03 , S-11,)

Salesmen Districts A B C D E
A B C D E A 0 2 5 7 1
1 32 38 40 28 40 B 6 0 3 8 2
2 40 24 28 21 36 C 8 7 0 4 7
3 41 27 33 30 37 D 12 4 6 0 5
4 22 38 41 36 36 E 1 3 2 8 0
5 29 33 40 35 39 A salesmen wants to visit cities A , B , C , D , E. He does not want to visit any city
twice before completing his tour of all cities and wishes to return to the point
of starting journey. Cost of going one city to another in rupees is shown in table. (-) indicate that the particular route is prohibited. Find the optimum route for
Find the list cost rout. (S-18) the vendor to follow. Also find out optimum cost. (W-09)

2. A salesmen must travel from city to city to maintain his accounts. This week 5. Sole the following traveling salesmen problem by branch bound method :
he has to leave his home base and visit all other cities and return home. The (S-10)
table shows the distance in km. between various cities. The home city is A. Use
A B C D E F
Branch and Bound method to determine the tour that will minimize the total
A * 2 7 1 8 12
distance of visiting all cities and returning home. (W-04)
B 12 * 6 8 9 10
From To City C 3 11 * 15 7 1
City A B C D E D 12 6 1 * 7 10
A - 375 600 150 190 E 5 12 13 10 * 4
B 375 - 300 350 175 F 4 7 8 12 15 *
C 600 300 - 350 500
D 150 350 350 - 300
6. A travelling salesman has to visit five cities. He wishes to start from particular
E 190 175 500 300 -
city, visit each city once and then return to his starting point. The travelling cost
(in Rs. Thousand) of each city from a particular city is given below. (W-10)
3. Sole the following traveling salesmen problem by branch bound method :
From To City
(S-09)
City A B C D E
A B C D E F A ∞ 2 5 7 1
A * 2 7 1 8 12 B 6 ∞ 3 8 2
B 12 * 5 6 10 3 C 8 7 ∞ 4 7
C 3 11 * 15 7 1 D 12 4 6 ∞ 5
D 12 6 1 * 7 10 E 1 3 2 8 ∞
E 5 12 13 10 * 4
F 4 7 8 12 15 *
7. A m/c operator processes five types of items on his m/c each week and must
choose a sequence for them. The setup cost per change depends on the items
4. A vendor supplies to five buyers located in five different cities. Cost of presently on the machine and setup to be made according to the following
traveling from one city to other is independent of direction and is given in table. table, if he processes each type of item one and only once each week. How
should be sequence the items on each machine. (S-13) -OR-
Route Cost (Rs.) Route Cost (Rs.)
A-B 16 B-D - Five products A , B , C , D , E are to be processed on a machine. Find the optimum
A-C 4 B-E 8 sequence of processing in order to minimize total setup cost.
A-D 12 C-D 5
A-E - C-E 6
B-C 6 D-E 20
 A B C D E
A ∞ 4 7 3 4
B 4 ∞ 6 3 4
C 7 6 ∞ 7 5
D 3 3 7 ∞ 7
E 4 4 5 7 ∞

8. Solve the following travelling salesmen problem so as to minimize travel cost.

Use branch bound technique.

A B C D E
A - 3 6 2 3
B 3 - 5 2 3
C 6 5 - 6 4
D 2 2 6 - 6
E 3 3 4 6 -

9. A salesman wants to visit four cities B , C , D , E and comes back to his

headquarters A. The distance matrix for these cities is shown in table. Find the
optimal route foe the salesman.

A B C D E
A 0 50 9 20 140
B 50 0 40 80 70
C 90 40 0 120 110
D 20 80 120 0 65
E 140 60 110 70 0