Reg No.

MAA4301
OPTIMIZATION TECHNIQUES
Time: 3 Hours Maximum: 100 Marks
PART A (10 x 2 = 20 marks) CO BTL
Answer ALL questions
All questions carry equal marks
1. Define Objective Function 1 1
2. What are the limitations of solving a LPP using Graphical method in Operations 1 1
Research?
3. Write down the general form of Linear Programming problem. 1 1
4. Define Decision Variables 1 1
5. Write any two limitations of Operations Research in Engineering. 1 1
6. Define No feasible solution in Graphical Method. 1 1
7. How do we convert a minimization problem to a maximization problem while 2 1
solving an LPP?
8. What does ‘M’ stands for in Big M Method? When do we apply Big M Method in 2 1
LPP?
9. Define Slack and Surplus variables. 2 1
10. Write the dual problem of the following LPP 2 2
Min Z=3𝑥 + 2.5𝑥
Subject to
2𝑥 + 4𝑥 ≥ 40,
3𝑥 + 2𝑥 ≥ 50, and 𝑥 , 𝑥 ≥
0.
11. Define Optimum solution. 2 1
12. Write down all the characteristics of canonical form. 2 1
13. Define Pure Integer Programming Problem 3 1
14. Write the General form of Integer Programming Problem 3 1
15. List out the methods to solve Integer Programming Problem. 3 1
16. Define Integer Programming Problem. 3 1
17. Write the methods for solving an Integer Programming problem. 3 1
18. Define Unbalanced Assignment Problem. 4 1
19. Write any two difference between Transportation and Assignment Problem 4 1
20. Define Assignment Problem. 4 1
21. Write the methods of finding Initial Basic Feasible Solution in Transportations 4 1
Problem.
22. Define an activity. 5 1
23. Define Predecessor. 5 1
24. Define Successor. 5 1
25. Define PERT. 5 1
26. Draw a network for the following B,C,D > A ; E > B,C,D. 5 2
27. In a PERT network if 𝑡 = 2, 𝑡 = 5, 𝑡 = 8 , then find the value of expected duration 𝑡 . 5 2

PART B (5 x 6 = 30 marks) CO BTL

Answer ALL choosing either (a) or (b) of each question
All questions carry equal marks
28. Explain in brief the objectives of Operations Research 1 3
29. Suppose an industry is manufacturing two types of products P1 and P2. The 1 3
profits per Kg of the two products are Rs.30 and Rs.40 respectively. These
two products require processing in three types of machines. The following
table shows the available machine hours per day and the time required on
each machine to produce one Kg of P1 and P2. Formulate the problem in
the form of linear programming model.
Profit/Kg P1(Rs.30) P2(Rs.40) Total
available
machine
hours/day
Machine 1 3 2 600
Machine 2 3 5 800
Machine 3 5 6 1100
30. Explain the objectives, scope and limitations of Operations Research. 1 3
31. A firm manufactures two types of products A & B and sells them at a profit 1 3
of Rs. 2 on type A and Rs. 3 on type B. Each product is processed on two
machines 𝑀 and 𝑀 . Type A requires 1 minute of processing time on 𝑀
and 2 minutes on 𝑀 . Type B requires 1 minute on 𝑀 and 1 minute on 𝑀 .
Machine 𝑀 is available for not more than 6 hours 40 minutes while
machine 𝑀 is available for 10 hours doing any working day. Formulate the
problem as a LPP so as to maximize the profit.
32. Explain briefly the scope of Operations Research. 1 3
33. A firm engaged in producing two models A and B, performs three 1 3
operations painting, assembly and testing. The relevant data are as follows:
Model Unit sale Hours required for each unit
price
Assembly Painting Testing
A Rs. 50 1.0 0.2 0.1
B Rs. 80 1.5 0.2 0.1
Total number of hours available are:
Assembly 600, painting 100, testing 30. Determine weekly production
schedule to maximize the profit.
34. Express the following LPP in standard form. 2 3
Min Z=𝑥 + 3𝑥
Subject to
 2𝑥 + 3𝑥 ≤ 2,
𝑥 + 𝑥 ≥ −2,
3𝑥 + 𝑥 ≤ −3, and 𝑥 , 𝑥
≥ 0.
35. Write the dual of the given primal LPP. 2 3
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 7𝑥 + 3𝑥 + 8𝑥 Subject
to
8𝑥 + 2𝑥 + 𝑥 ≤ 3
3𝑥 + 6𝑥 + 4𝑥 ≤ 4
4𝑥 + 𝑥 + 5𝑥 ≤ 1
𝑥 + 5𝑥 + 2𝑥 ≤ 7 and 𝑥 , 𝑥 , 𝑥 ≥ 0
36. (i) Express the following LPP in the canonical form. 2 3
Max Z=2𝑥 + 3𝑥 + 𝑥
Subject to
4𝑥 − 3𝑥 + 𝑥 ≤ 6,
𝑥 + 5𝑥 − 7𝑥 ≥ −4, and 𝑥 , 𝑥 ≥ 0, 𝑥 is unrestricted.
(ii) Express the following LPP in standard form.
Min Z=𝑥 + 3𝑥
Subject to
2𝑥 + 3𝑥 ≤ 2,
𝑥 + 𝑥 ≥ −2,
3𝑥 + 𝑥 ≤ −3, and 𝑥 , 𝑥 ≥
0.
37. Solve the following LPP by Big-M method 2 3
Max Z=3𝑥 + 2𝑥
Subject to
2𝑥 + 𝑥 ≤ 2,
3𝑥 + 4𝑥 ≥ 12, and 𝑥 , 𝑥 ≥
0.
38. Solve by Two-Phase simplex method upto Phase I solution for the 2 3
following LPP
𝑀𝑎𝑥 𝑍 = −4𝑥 − 3𝑥 − 9𝑥
Subject to
2𝑥 + 4𝑥 + 6𝑥 − 𝑆 +𝑅 =
15 6𝑥 + 𝑥 + 6𝑥 − 𝑆 + 𝑅 =
12
𝑥 , 𝑥 , 𝑥 , 𝑆 , 𝑆 , 𝑅 , 𝑅 ≥ 0.
39. Construct the Dual of the following primal LPP 2 3
𝑀𝑎𝑥 𝐹 = 𝑥 + 2𝑥 + 𝑥
Subject to
2𝑥 + 𝑥 − 𝑥 ≤ 2
−2𝑥 + 𝑥 − 5𝑥 ≥ −6
4𝑥 + 𝑥 +𝑥 ≤6
and 𝑥 , 𝑥 , 𝑥 ≥ 0.
40. Write a brief note on Branch and Bound Technique. 3 3
41. Find the initial simplex table for the following IPP 3 3
Max Z=𝑥 + 𝑥
 Subject to

3𝑥 + 2𝑥 ≤ 5, 𝑥 ≤ 2,
and 𝑥 , 𝑥 ≥ 0 and are integers.

42. Write a brief note on Cutting plane method. 3 3

43. Describe the methodology of Branch and Bound method of Integer 3 3

Programming problem.
44. Find the optimum integer solution to the following IPP 3 3
𝑀𝑎𝑥 𝑍 = 𝑥 + 𝑥
Subject to
3𝑥 + 2𝑥 ≤ 5 𝑥 ≤
2
and 𝑥 > 0, 𝑥 ≥ 0 and are integers.
45. Find the initial basic feasible solution using North West Corner Rule 4 3
Source/Destination 1 2 3 4 Supply
1 10 2 20 11 15
2 12 7 9 20 25
3 4 14 16 18 10
Demand 5 15 15 15
46. Solve the Assignment Problem 4 3
1 2 3 4 5
A 13 8 16 18 19
B 9 15 24 9 12
C 12 9 4 4 4
D 6 12 10 8 13
E
15 17 18 12 20
47. Solve the Assignment Problem for the following data: 4 3
1 2 3 4
A 11 17 8 16
B 9 7 12 6
C 13 16 15 12
D 14 10 12 11
48. Find the transportation problem using North West Corner Rule for the
following table:

Source/Destination 1 2 3 Demand
1 2 7 4 5
2 3 3 1 8
3 5 4 7 7
4 1 6 2 14
Supply 7 9 18 34
49. Consider the problem of assigning 5 jobs to 5 persons. The assignment 4 3
costs are given as follows:-

Jobs
1 2 3 4 5
A 8 4 2 6 1
B 0 9 5 5 4
C 3 8 9 2 6

Persons
D 4 3 1 0 3
E 9 5 8 9 5
signment schedule and optimum assignment
Find the optimum ascost.
50. Find the IBFS for the following transportation problem by VAM 4 3
D1 D2 D3 D4 Availability
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Requirement 200 225 275 250

51. Given the following data, Draw a network with usual notation 5 3
Activity Time in weeks
1-2 4
1-3 2
1-4 10
2-5 12
3-5 6
2-6 12
5-6 9
4-6 8
52. A small project is composed of activities whose time estimates are given in 5 3
the following table:
Time required

Activity Optimistic Most likely Pessimistic

1-2 1 2 3
2-3 1 2 3
2-4 1 3 5
3-5 3 4 5
4-5 2 3 4
4-6 3 5 7
5-7 4 5 6
 6-7 6 7 8
7-8 2 4 6
7-9 4 6 8
8-10 1 2 3
9-10 3 5 7
Find the expected duration.

53. Draw the network for the following data: 5 3

Activity Duration(hrs)
1-2 1
2-3 5
2-4 3
3-5 4
4-5 2
4-6 5
4-7 9
5-7 4
6-7 2
7-8 2
54. A project consists of the following activities and different time estimates. 5 3
Time required

Activity Least time(days) Greatest Most likely

time(days) time(days)
1-2 3 15 6
1-3 2 14 5
1-4 6 30 12
2-5 2 8 5
2-6 5 17 11
3-6 3 15 6
4-7 3 27 9
5-7 1 7 4
6-7 2 8 5
Find the expected duration.
55. Find the critical path for the following. 5 3
Activity A B C D E F G H I
Predecessor - - - A B C D,E B H,F
Time 3 5 4 2 3 9 8 7 9
56. Define the following 5 4
a) Optimistic time
b) Pessimistic time
c) Most likely time.
 CO BTL
PART C (5 x 10 = 50 marks)
Answer ALL choosing either (a) or (b) of each question
All questions carry equal marks
57. Solve the following LPP by graphical method 1 3
Max Z=3𝑥 + 2𝑥
Subject to
−2𝑥 + 𝑥 ≤ 1,
𝑥 ≤ 2,

𝑥+𝑥≤3
and 𝑥 , 𝑥 ≥ 0.
58. Solve the following LPP by graphical method 1 3
Min Z = − 2𝑥 − 3𝑥
Subject to
𝑥 − 𝑥 ≤ 2,
𝑥 + 𝑥 ≥ 4, and 𝑥 , 𝑥 ≥ 0.

59. Solve the following LPP by graphical method 1 3

Max Z=6𝑥 + 3𝑥
Subject to
4𝑥 + 3𝑥 ≤ 6,
𝑥 + 4𝑥 ≥ 4, and 𝑥 , 𝑥 ≥ 0.

60. Solve the following LPP by graphical method 1 3

Min Z=2𝑥 + 6𝑥
Subject to
4𝑥 + 6𝑥 ≥ 4,
𝑥 + 4 𝑥 ≤ 6,
𝑥 + 3𝑥 ≥ 5 and 𝑥 , 𝑥 ≥ 0.

61. A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes 1 3
he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs
0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average
yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000
kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the
amount required per acre is 100 kgs each for tomatoes and lettuce and 50
kilograms for radishes. Labour required for sowing, cultivating and
harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-
days for lettuce. A total of 400 man-days of labour are available at Rs 20
per man-day. Formulate this problem as a LPP to maximize the farmer's
total profit.
62. Solve the following LPP graphically 1 3
𝑀𝑎𝑥 𝑍 = 100 𝑥 + 40 𝑥
Subject to
5𝑥 + 2𝑥 ≤ 1000
3𝑥 + 2𝑥 ≤ 900 𝑥 +
2𝑥 ≤ 500
and 𝑥 , 𝑥 ≥ 0.
63. Solve the following LPP by simplex method 2 3
Max Z=4𝑥 + 10𝑥
Subject to
2𝑥 + 𝑥 ≤ 100,
2𝑥 + 5𝑥 ≤ 200,
2𝑥 + 3𝑥 ≤ 180 and 𝑥 , 𝑥≥ 0.
64. Solve the following LPP by Two-Phase method 2 3
Max Z=5𝑥 + 3𝑥
Subject to
2𝑥 + 𝑥 ≤ 1,
𝑥 + 4𝑥 ≥ 6,

𝑥 , 𝑥≥ 0.

65. Use Big-M method to solve 2 3

𝑀𝑖𝑛 𝑍 = 4𝑥 + 3𝑥
Subject to
2𝑥 + 𝑥 ≥ 10
−3𝑥 + 2𝑥 ≤
6𝑥+𝑥 ≥6
and 𝑥 , 𝑥 ≥ 0.
66. Solve the LPP using Simplex method 2 3
max 𝑧 = 4𝑥 + 10𝑥
Subject to constraints
2𝑥 + 𝑥 ≤ 50
2𝑥 + 5𝑥 ≤ 100 2𝑥
+ 3𝑥 ≤ 90
and 𝑥 , 𝑥 ≥ 0.
67. Solve the following IPP by branch and bound method 3 3
Max Z=2𝑥 + 2𝑥
Subject to
5𝑥 + 3𝑥 ≤ 8,
𝑥 + 2𝑥 ≤ 4,
𝑥 , 𝑥 ≥ 0 𝑎𝑛𝑑 𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠.
68. Solve the following IPP by Gomory’s cutting plane method 3 3
Max Z=𝑥 + 𝑥
Subject to
2𝑥 + 5𝑥 ≤ 16, 6 𝑥 + 5 𝑥 ≤ 30, and 𝑥 ≥ 0
and 𝑥 𝑖𝑠 𝑎 𝑛𝑜𝑛 𝑛𝑒𝑔𝑎𝑡𝑖𝑣𝑒 integer.

69. Solve the following IPP by Gomory’s cutting plane method 3 3

Max Z=𝑥 + 𝑥
Subject to
3𝑥 + 2𝑥 ≤ 5,
𝑥 ≤ 2,
𝑥 > 0, 𝑥≥ 0 and are integers.
70. Use Branch and Bound method to solve the 3 3
following:
 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 2𝑥 + 2𝑥
Subject to
5𝑥 + 3𝑥 ≤ 8 𝑥 +
2𝑥 ≤4
and 𝑥 , 𝑥 ≥ 0 and integer.
71. Find the optimal transportation cost 4 3
Demand
5 1 7 10
6 4 6 80
3 2 5 15
Supply 45 20 40

72. Find the optimal solution of the Assignment Problem using Hungari an 4 3
Method
1 4 6 3
9 7 10 9
4 5 11 7
8 7 8 5
73. Solve the assignment problem for maximization given the pro fit 4 3
matrix(profit in Rupees)
P Q R S
A 51 53 54 50
B 47 50 48 50
C 49 50 60 61
D 63 64 60 60
74. Solve the transportation problem with unit transportation costs in rupees, 4 3
demands and supplies as given below:
D1 D2 D3 SUPPLY
A 5 6 9 100
B 3 5 10 75
C 6 7 6 50
D 6 4 10 75
DEMAND 70 80 120
75. Draw the critical path using network diagram and also find the totalon 5 3
durati of the project given by
Activity 1-2 1-3 2-4 3-4 3-5 4-5 4-6 5-6

Duartion(Days) 6 5 10 3 4 6 2 9

76. Find the variance and standard deviation of each activity given by 5 3

Activity 1-2 1-6 2-3 2-4 3-5 4-5 6-7 5-8 7-8

𝑡 3 2 6 2 5 3 3 1 4
 𝑡 6 5 12 5 11 6 9 4 19

𝑡 15 14 30 8 17 15 27 7 28

77. Find the variance and standard deviation of each activity is given by 5 3
Activity 1-2 1-3 1-4 2-4 2-5 3-4 4-5
𝑡 4 8 6 2 3 2 3
𝑡 5 9 8 4 4 3 5
𝑡 6 11 12 6 6 4 8
78. Draw the network and determinate the critical path of the given data and 5 3
find the total float, free float of each activity.
Jobs 0-1 1-2 1-3 2-4 2-5 3-4 3-6 4-7 5-7 6-7
Duration 3 8 12 6 3 3 8 5 3 8
(Days)
79. A project is represented by the following network given below: 5 3
Activity 1- 2 1-3 1-4 2-6 3-6 4-7 5-7 6-7

Optimistic time 5 18 26 15 6 7 7 3
Det Most likely time 8 20 33 20 9 10 8 4
erm
Pessimistic time 10 22 40 25 12 12 9 5
ine
the following
Expected task times and their variance.
i. ii.
The critical path.