Exercise Problems

1. A company manufactures three products A, B and C, which require three raw

materials I, II and III. The table given below shows the amount of raw materials
required per kg of each product. The resource availability per day and the profit
contribution for each product is also given.
162
Quantitative Techniques
for Management
i. Formulate the problem as a linear programming problem.
ii. Solve the problem and determine the optimal product mix.
2. A metal fabricator manufactures three types of windows. Each of the windows
needs four processes. The time taken on various machines differ due to the size of
windows. The time taken and available hours are given in the table below:
The profit contribution for windows A, B and C are Rs. 3.00, Rs. 4.00 and Rs. 5.00
respectively.
a. Formulate the problem.
b. Solve the problem using simplex method to maximize the profit.
c. Determine the excess time available in each processes and by how much.
3. Solve the following LPP using simplex method.
Maximize , Z = 2x1 + x2
Subject to constraints,
4x1+ 3x2 12 .....................(i)
4x1+ x2 8 .....................(ii)
4x1 x2 8 .....................(iii)
where x1, x2 0
4. Solve the following LPP:
Zmax = 20x1 + 28x2 + 23x3
Subject to constraints,
4x1+ 4x2 75 ....................(i)
2x1+ x2 + 2x3 100 ....................(ii)
3x1+ 2x2 + x3 50 ....................(iii)
where x1, x2, x3 0
5. Three high precision products are manufactured by a Hi-Tech Machine Tools
Company. All the products must undergo process through three machining centers
A, B and C. The machine hours required per unit are,
Product
Raw Material
A B C Availability (kg)
I 4 1 6 800
II 5 6 8 1500
III 2 4 1 1200
Profit per unit (Rs) 9 10 6
Window Type Cutting Heat Treating Forging Grinding
A 5 7 1 4
B 7 4 4 8
C 4 8 6 2
Available time (Hrs) 20 24 28 22
163
Linear Programming :
Simplex Method
The available time in machine hours per week is
It is estimated that the unit profits of the product are
a. Formulate the problem as a LPP.
b. Solve the problem to determine the optimal solution. What is the number of
units to be made on each product.
c. Does machining center C has any extra time to spare? If so, how much spare
time is available ?
d. If additional 10 machine hours are available with machining center A, then
what is the optimal product mix ? What is the change in the value of profit ?
6. Raghu Constructions is considering four projects over the next 3 years. The expected
returns of each project and cash outlays for these projects are listed in the tables
given. All values are in Lacs of Rupees.
Raghu has to decide to undertake construction projects. Ignore the time value of
money. As a consultant, what suggestion you would like to give Raghu in deciding
about the projects to select. Determine the solution using TORA.
7. Solve the following LP Problem using Big M Method.
Minimize, Z = 2x1+ 9x2 + x3
Subject to constraints,
x1+ 4x2+ 2x3 5 .......................(i)
3x1 + x2 + 2x3 4 .......................(ii)
where x1, x2, x3 0
8. Solve the following LPP
Zmin = 4x1 + x2
Machining Center Product
I II III
A 2 4 6
B 3 6 2
C 3 2 1
Machining Center Machine Hours Per Week
A 150
B 100
C 120
Product Unit Profits (Rs)
I 3
II 4
III 6
Cash outlay (lakh Rs.)
Project
Year 1 Year 2 Year 3
Return
1 12.32 11.10 9.50 42.25
2 11.15 9.75 8.11 31.20
3 7.65 5.50 4.75 15.10
4 10.71 10.31 7.77 12.05
Available funds
(lakh Rs.)
110.00 40.00 35.00
164
Quantitative Techniques
for Management
Subject to constraints,
3x + x2 = 3 .................(i)
4x +3x2 6 .................(ii)
x1 + 2x2 3 ................(iii)
where x1, x2 0
9. Solve the following LPP. Find whether multiple or alternate solution exists
Maximize Z = 2x1+ 4x2 + 6x3
Subject to constraints,
10x1 + 4x2 + 6x3 150 ..................(i)
8x1+ 6x2 + 2x3 100 ..................(ii)
x1 + 2x2 + x3 120 ....................(iii)
where x1, x2, x3 0
10. Write the dual of the following LP problem
Minimize Z = 6x1 4x2 + 4x3
Subject to constraints,
3x1 + 10x2 + 4x3 15 .......................(i)
12x1 + 2x2 + 5x3 4 ...................(ii)
5x1 4x2 2x3 10 ...................(iii)
x1 3x2 + 6x3 3 ...................(iv)
4x1 + 9x2 4x3 2 ...................(v)
where x1, x2, x3 0
11. Obtain the dual of the following linear programming problem
Maximize Z , = 4x1 + 9x2 + 6x3
Subject to constraints,
10x1 + 10x2 2x3 6 .......................(i)
-5x1 + 5x3 + 6x3 8 .......................(ii)
14x1 2x2 5x3 20 ........................(iii)
5x1 4x2 +7x3 3 ........................(iv)
8x1+ 10x2 5x3 = 2 .......................(v)
where x1, x2, x3 0
5.17 MODEL ANSWERS TO QUESTIONS FOR
DISCUSSION
1. (a) True (b) True (c) False
5.18 SUGGESTED READINGS
Dantzig, G and M. Thapa, Linear Programming 1: Introduction, Springer,
New York 1997.
Simonnard M., Linear Programming. Englewood Cliffs, N.J. Prentice Hall, 1966.
Bersitman, D, and J Tsitsiklin, Introduction to Linear Optimization, Belmont. Mass:
Athena Publishing 1997.