MANUFACTURING TECHNOLOGY – II

(ME 305)
Course instructor : Prof. Harpreet Singh
Tutorial 1
Question No. 1
(Completion Time : 10 minutes)

Hint
1. Construct a graph and plot the constraint
lines
2. Determine the valid side of each constraint
line
3. Identify the feasible solution region
4. Find the optimum point for which objective
function is Maximum
 Question No. 2
(Completion time : 15 minutes)
The Whitt Window Company is a company with only three employees which makes two different kinds of
hand-crafted windows: a wood-framed and an aluminum-framed window. They earn $60 profit for each
wood-framed window and $30 profit for each aluminum-framed window. Doug makes the wood frames, and
can make 6 per day. Linda makes the aluminum frames, and can make 4 per day. Bob forms and cuts the
glass, and can make 48 square feet of glass per day. Each wood-framed window uses 6 square feet of glass
and each aluminum-framed window uses 8 square feet of glass. The company wishes to determine how
many windows of each type to produce per day to maximize total profit.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical model to solve this model.
(c) A new competitor in town has started making wood-framed windows as well. This may force the company
to lower the price they charge and so lower the profit made for each wood framed window. How would the
optimal solution change (if at all) if the profit per wood-framed window decreases from $60 to $40? From
$60 to $20?
(d) Doug is considering lowering his working hours, which would decrease the number of wood frames he
makes per day. How would the optimal solution change if he makes only 5 wood frames per day?
Question no. 3
(Completion time: 10 minutes)
 MANUFACTURING TECHNOLOGY – II
(ME 305)
Course instructor : Prof. Harpreet Singh
Tutorial 2
Question 1
(Completion time: 15 minutes)
A firm produces products A, B & C each of which passes through three
departments Fabrication, Finishing & Packaging. Each unit of product A
requires 3, 5 & 2, a unit of product B requires 4, 4 & 4 while each unit
of C requires 5, 4 & 5 hours respectively in the three departments.
Everyday 60 hours are available in Fabrication, 72 hours are available in
Finishing and 100 hours in Packaging department. If the unit
contribution of product A is Rs.5/-, product B is Rs.10/-, product C is
Rs.8/-, determine the number of units of each of the products, that
should be made each day to maximize the total contribution.
Question no. 2
(Completion time: 15 minutes)
Question no. 3
(Completion time: 10 minutes)
Question no. 4
(Completion time: 20 minutes)
Web Mercantile sells many household products through an online catalog. The company needs substantial
warehouse space for storing its goods. Plans now are being made for leasing warehouse storage space over the
next 5 months. Just how much space will be required in each of these months is known. However, since these
space requirements are quite different, it may be most economical to lease only the amount needed each
month on a month-by-month basis. On the other hand, the additional cost for leasing space for additional
months is much less than for the first month, so it may be less expensive to lease the maximum amount
needed for the entire 5 months. Another option is the intermediate approach of changing the total amount of
space leased (by adding a new lease and/or having an old lease expire) at least once but not every month. The
space requirement and the leasing costs for the various leasing periods are as follows:

The objective is to minimize the total leasing cost for meeting the space requirements.
(a) Formulate a linear programming model for this problem.
(b) Solve this model by the simplex method.
 MANUFACTURING TECHNOLOGY – II
(ME 305)
Course instructor : Prof. Harpreet Singh
Tutorial 3
Question no. 1
(Completion time: 25 minutes)
An air force is experimenting with 3 type of bonds P, Q and R in which 3
kinds of explosives, viz. A, B and C will be used. Taking the various
factors into account, it has been decided to use at the maximum 600 kg
of explosive A, at least 480 kg of explosive B and exactly 540 kg of
explosive C. Bomb P requires 3,2,2 kg, bomb Q requires 1,4,3 kg and
bomb R requires 4,2,3 kg of explosives A,B and C respectively. Bomb P
is estimated to give the equivalent of a 2 ton explosion, bomb Q, a 3
ton explosion and bomb R, a 4 ton explosion respectively. Under what
production schedule can the air force make the biggest bang?
Question no. 2
(Completion time: 8 minutes)
Question no. 3
(Completion time: 8 minutes)
 MANUFACTURING TECHNOLOGY – II
(ME 305)
Course instructor : Prof. Harpreet Singh
Tutorial 4
Question no. 1
(Completion time: 20 minutes)
• Find the basic feasible solution of the following transportation problem using:
(i) North-west corner method
(ii) Row minima method
(iii) Column minima method
(iv) Least cost method
(v) Vogel’s approximation method (VAM)

Distribution centres (Destinations)

1 2 3 4 Supply
Plants(Origins)

1 2 3 11 7 6
2 1 0 6 1 1
3 5 8 15 9 10
Requirement 7 5 3 2
Question no. 2
(Completion time: 20 minutes)
• A company has 4 warehouses and 6 stores. The warehouse altogether have a surplus of 22 units of a given
commodity, divided among them as follows: Warehouse 1 2 3 4
Surplus 5 6 2 9
The 6 stores altoghether need 22 units of the commodity. Individual requirement at the stores 1,2,3,4,5 and 6 are
4,4,6,2,4 and 2 units respectively.
Cost of shipping 1 unit of commodity from warehouse I to store J in rupees is given in the matrix below:
Stores
1 2 3 4 5 6
Warehouses

1 9 12 9 6 9 10
2 7 3 7 7 5 5
3 6 5 9 11 3 11
4 6 8 11 2 2 10

How should the product be shipped from the warehouses to the stores so that the transportation cost is minimum?
 MANUFACTURING TECHNOLOGY – II
(ME 305)
Course instructor : Prof. Harpreet Singh
Tutorial 5
 Question no. 1
(Completion time: 15 minutes)
Four cargo ships will be used for shipping goods from one port to four other ports (labeled 1, 2, 3,
4). Any ship can be used for making any one of these four trips. However, because of differences in
the ships and cargoes, the total cost of loading, transporting, and unloading the goods for the
different ship-port combinations varies considerably, as shown in the following table:

The objective is to assign the four ships to four different ports in such a way as to minimize the total cost for all four
shipments.
(a) Describe how this problem fits into the general format for the assignment problem.
(b) Obtain an optimal solution.
(c) Reformulate this problem as an equivalent transportation problem by constructing the appropriate parameter
table and sse the northwest corner rule, Least cost method and VAM to obtain an initial BF solution for the problem.
Question no. 2
(Completion time: 12 minutes)
The coach of an age group swim team needs to assign swimmers to a 200-yard medley relay team to
send to the Junior Olympics. Since most of his best swimmers are very fast in more than one stroke,
it is not clear which swimmer should be assigned to each of the four strokes. The five fastest
swimmers and the best times (in seconds) they have achieved in each of the strokes (for 50 yards)
are

(a) Formulate this problem as an assignment problem.

(b) Obtain an optimal solution.
Question no. 3
(Completion time: 12 minutes)
Question no. 4
(Completion time: 10 minutes)
Question no. 5
(Completion time: 12 minutes)