Assignment LPP

1. Obtain the Optimal solution to the following linear programming problem.

Minimize Z = X1 + X2 + X3
S. T. C. X1 - 3X2 + 4X3 = 5,

X1 - 2X2 < 3
2X2 - X3 > 4
Where, X1, X2 >0, X3 unrestricted in sign
2. A small company has 5 skilled and 10 semiskilled men and produces two products
with the following information:
Products P1 P2 Hours Available
Man Hours Skilled 2 1 40
Man Hours Unskilled 2 3 80
Profit/Unit (Rs.) 10 8
By union rules no man work more than 8 hours. Formulate this as a linear programming
and solve graphically.
3. A Co. that produces soft drinks has a contract that requires that a minimum of 80
units of the chemical A and 60 units of the chemical B into each bottle of the drink.
The chemicals are available in a prepared mix from two different suppliers. Supplier
X1 has a mix of 4 units of A and 2 units of B that costs Rs. 10, and Supplier X2 has a
mix of 1 unit of A and 1 unit of B that Costs Rs. 4. How many mixes from company
X1 and Company X2 should the company purchase to honor contract requirement and
yet minimize cost? Solve it graphically.
4. A company has two grades of inspectors, 1 and 2 to undertake quality control
inspection. At least 1500 pieces must be inspected in an 8- hour’s day. Grade 1
inspectors can check 20 pieces in an hour with an accuracy of 96%. Grade 2
inspectors check 14 pieces an hours with an accuracy of 92%.The daily wages of
grade 1 inspectors are Rs. 5 per hour while those of grade 2 inspector are Rs. 4 per
hour. Any error made by an inspector costs Rs. 3 to the company. If there are, in all,
10 grade 1 inspector and 15 grade 2 inspectors in the company, find the optimal
assignment of inspectors that minimize the daily inspection cost. Formulate the
problem and solve it graphically.
5. Solve by simplex method:
Maximize Z=10x + 15y
Subject to: 2x + y < 26
2x + 4y < 56
x – y > -5 x,y > 0
6. Solve graphically:
Minimize Z = 2y – x
Subject to: 0.5x + 0.5y < 3
2x – 2y > 4 x,y > 0

7. A company produces two types of pens, say A & B. Pen A is of superior quality and
Pen B is of inferior quality. Profit on pens A & B is Rs 5 & Rs 3 per pen respectively.
Raw material required for each pen A is twice as that for pen B. The supply of raw
 materials is sufficient only for 1000 pens. Pen A requires a special clip and only 400
such clips are available per day. For pen B, only 700 clips are available per day. Find
graphically the product mix so that the company can make maximum profit.
8. A company produces two types of container K & L. Each product has resources
requirement and profit contribution as follows:
Resources K L Total resources available
Material (kg/unit) 1 2 10 kgs
Labour (hr/unit) 6 6 36 ours
Profit 4 5
In addition, because of demand, a maximum of 4 units of container K will be produced.
By Simplex method obtain the optimal plan that maximizes the profit.
9. A farmer has 2000 acres of land on which he can grow corn wheat soybean. Each
acre of corn costs Rs. 200 for preparation, requires 14 man days and yields a profit of
Rs. 60. An acre of wheat cost Rs. 240 to prepare, Requires 20 man days and yields a
profit of Rs. 80. An acre of soybean costs Rs. 140 to prepare requires 16 man days of
work and yields a profit of Rs. 40. If farmer has Rs. 2 Lakh for preparation and can
count on 16000 man days of work, how many acres should be allocated to each crop
to maximize profits.

10. A company is engaged in producing three products A, B, C. The following data is

available
Products A B C
Net Sale Price (Rs. Per Unit) 10 12 15
Cost (Per Unit) 6 9 10

The wholesaler who is responsible for selling to the customer is to be paid Rs. 150
per day irrespective of the quantities sold in each of the products. The products are
processed in three different operations. The time (hrs) required to produce one product in
each of the operations and the daily capacity (hrs) available for each operation Centre are
given as

Products
Operations A B C Daily Capacity
(hrs)
1 2 3 2 400
2 3 2 2 350
3 1 4 2 300

What product mix would yield maximum profits and how much.
 Class: M.B.A 3rd Semester
Assignment:2 (Assignment Model)

1. A firm produces four products. There are four operators who are capable of
producing any of these four products. The processing time varies from
operator to operator. The firm records 8 hours a day and allows 30 minutes for
lunch. The processing time in minutes and profit for each of products are
given below:
Operators Products
A B C D
1 15 9 10 6
2 10 6 9 6
3 25 15 15 9
4 15 9 10 10
Profits (Rs.) per unit 8 6 5 4
Find the optimal assignment of products to operators.
2. An airline operating for seven days a week has time table shown below. Crew must
have a minimum layover (rest time) of 5 hrs between flights. Obtain the pair of flights
that minimizes lay over time away from home. For any given pair the crew will be
based at the city that results in the smaller layover. For each pair , mention the town
where the crews should be based.
Delhi Jaipur Jaipur Delhi
Flight No. Departure Arrive Flight No. Departure Arrive
1 7:00 A.M 8: 00 A.M 101 8:00 A.M 9:15 A.M
2 8:00 A.M 9:00 A.M 102 8:30 A.M 9:45 A.M
3 1:30 P.M 2:30 P.M 103 12:00 noon 1:15 A.M
4 6:30 A.M 7:30 P.M 104 5:30 P.M 6:45 P.M

3. In a textile sales emporium 4 salesmen are available to 4 counters. Each salesman can
handle any counter. The service (in hours) of each counter which is managed by each
salesman is given below:

Salesman A B C D
W 41 72 39 52
Counter X 22 29 49 65
Y 27 39 60 51
Z 45 50 48 52
How should the salesman be allocated to appropriate counters so as to minimize the
service time. Each salesman must handle only one counter. Also indicate the total service
time.

4. A company has 5 jobs to be done. The following matrix shows the return in rupees on
assignment ith (i= 1,2,3,4,5) machine to jth job (J= a,b,c,d,e). Assign the five jobs to
the five machines so as to maximize the total expected profit.
Jobs
A B C D E
1 5 11 10 12 4
Machines 2 2 4 9 3 5
3 3 12 5 14 6
4 6 14 4 11 7
5 7 9 8 12 5

5. Solve the following ‘Traveling Salesman Problem” given by the following data:
C12 = 4, C13 = 7, C14 = 3, C23 = 6, C24 = 3, and C34 = 7, where Cij = Cji

6. Find the minimum cost solution for the 5x5 assignment problem whose cost
coefficients are as given below:
A B C D E
A -2 -4 -8 -6 -1
B 0 -9 -5 -5 -4
C -3 -8 -9 -2 -6
D -4 -3 -1 0 -3
E -9 -5 -8 -9 -5

7. Five mechanics are available to work on five machines and their respective cost in Rs
for each mechanic machine combination is given in the matrix below. A sixth
machine is available to replace one of the existing machines and the associated cost is
given in the table. Determine

a. Whether the new machine can be accepted.

b. Optimal assignment and the associated cost.

1 2 3 4 5 6
A 19 15 -- 16 13 22
B 13 -- 15 -- 21 14
C 15 17 19 20 12 18
D 20 22 16 18 17 --
E -- 16 14 19 18 15
Dummy 0 0 0 0 0 0
8. WELLDONE Company has taken the third floor of a multistoreyed building for rent
with a view to locate one of their zonal offices. There are five main rooms in this
floor to be assigned to five managers. Each room has its own advantages and
disadvantages. Some have windows; some are closer to the washrooms or to the
canteen or secretarial pool. The rooms are of all different sizes and shapes. Each of
the five managers were asked to rank their room preferences amongst the rooms 301,
302, 303, 304, 305. Their preferences were recorded in a table as indicated next:

Manager
M1 M2 M3 M4 M5
302 302 303 302 301
303 304 301 305 302
Rooms 304 305 304 304 304
-- 301 305 303 --
-- -- 302 -- --

Most of the managers did not list all the five rooms since they were not satisfied with
some of these rooms and they have left off these from the list. Assuming that there
preferences can be quantified by numbers, find out as to which manager should be
assigned to which rooms so that their total preference ranking is a minimum.

9. Imagine yourself to be the Executive Director of a 5 star hotel. Hotel has four banquet
halls. During a heavy marriage season, 4 parties approached you to reserve a hall on
the same day. These parties were told that the first choice among these halls will cost
Rs 10000. they were also told to list the preferences for second, third and fourth.
Party A & D are not interested in 3 & 4. other particulars are:
Revenue/ Hall
Hall
Marriage 1 2 3 4
Party
A 10000 9000 -- --
B 8000 10000 8000 5000
C 7000 10000 6000 8000
D 10000 8000 -- --
Decide on an allocation that will maximize the revenue to your hotel.