G72 Operations Research 2016-17.

Assignment 1

Linear Programming and Networking

PART A

1.

State the various phases of Operations Research.

2.

State the nature of Operations Research.

3.

State the fields of applications of Operations Research (OR).

4.

State the various models of study in OR / Classify OR models.

5.

State the characteristics of a good OR model.

6.

State the various methods used in studying the models of OR.

7.

What is Linear Programming?

8.

Define a Linear Programming Problem (LPP).

9.

What are the major parts of a LPP

10. What do you mean by Objective function of a LPP?

11. What do you mean by Constraints of a LPP
12. What do you mean by Non negative restrictions of a LPP
13. State the different steps to be followed in the formulation of a LPP
14. State the Mathematical Formulation of a General LPP.
15. State the different steps to be followed in solving a LPP of 2 variables using Graphical method.
16. Mention the disadvantages of Graphical solution
17. Mention the variants of graphical solution.
18. Define: The solution to a LPP.
19. Define: The Basic solution to a LPP.
20. Define: The Basic Feasible solution to a LPP.
21. Define: The Degenerate Basic Feasible solution to a LPP
22. Define: The Non - Degenerate Basic Feasible solution to a LPP
23. Define: The Optimum Basic Feasible solution to a LPP
24. State the various forms of representing a LPP
25. State the Characteristics of Standard form of a LPP
26. State the Characteristics of Canonical form of a LPP
27. Define Slack variables. Surplus variables, restricted variables and unrestricted variables.
28. Mention the standard Simplex table.
29. State the conditions on which the Simplex method is based on.
30. How will you identify the entering / entry variable using simplex table?
31. How will you identify the leaving / exit variable using simplex table?
32. What do you mean by Key element / pivot element?
33. How will you identify the infeasible solution from Simplex table computations?
34. How will you identify the multiple / alternate optimal solution from Simplex table computations?
35. How will you identify the unbounded solution from Simplex table computations?
36. State the variants of LPP solved using Simplex method.
37. What is integer Programming?
38. What is an integer Programming problem (IPP)?
39. State the different types of IPPs.
40. State the methods available for solving an IPP.
41. Briefly explain / state the different steps in branch and bound technique of solving an IPP
42. What do you mean by a transportation problem (TP)?
43. Give the mathematical formulation of a TP
44. Define: Basic Feasible Solution, Non degenerate Basic Feasible Solution,
45. Degenerate Basic Feasible Solution and Optimal Basic Feasible Solution to a TP.
46. What are rim requirements?
Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15

47. State the different methods available for finding an IBFS to a TP.
48. Explain NWCR briefly.
49. Explain Least Cost Method briefly.
50. Explain Vogels Approximation method briefly.
51. Which method give closer solution to Optimal Solution to a TP
52. Mention the various types of TPs.
53. When the allocations of a TP are said to be in independent positions?
54. Explain the test for optimality of a TP?
55. Explain briefly MODI method of obtaining Optimal Solution to a TP?
56. How will you solve a TP of Maximizing the objective function?
57. How will you solve an un balanced TP
58. What do you mean by an assignment problem (AP)?
59. Give the mathematical formulation of an AP
60. Distinguish between a TP and an AP.
61. State the variants of an AP.
62. Briefly explain the Hungarian method / algorithm of an AP.
63. What do you mean by minimum line coverage?
64. Briefly explain the process of solving a restricted AP.
65. Briefly explain the process of solving a maximization type AP.
66. Briefly explain the process for getting minimum line coverage.
67. Briefly explain the Traveling Salesman Problem (TSP).
68. Briefly explain the process of solving a TSP.
69. Define a Network / Arrow Diagram.
70. Define an activity
71. What are the possible ways of representing a Network?
72. state the rules for constructing a NW
73. State the Fulkersons rule of Numbering the Node of a Network.
74. What do you mean by a Dummy activity and What its role in a Network?
75. State the three main managerial functions of a project.
76. Define: Planning , Scheduling and Control.
77. Define : Early Start, Early Finish, Late Start and Late Finish of an Activity.
78. Define : Total float, Free float and Independent float of an activity.
79. State the techniques used for solving a project network.
80. Define : Pessimistic , Optimistic and Most Likely time of an activity.
81. State the basic differences between PERT and CPM.
82. What do you mean by crashing a NW
83. Define: Direct costs and Indirect Costs.
84. Define the Cost slope of an activity.
85. State the step by step procedure for crashing a NW.
PART B
1.

A farmer has 1000 acres of land on which he can grow Corn, Wheat or Soya beans. An acre of Corn costs Rs 100 for
preparation requires 7 man days of work and yields a profit of Rs.30. An acre of Wheat costs Rs 120 to prepare requires 10
man days of work and yield a profit of Rs.40. An acre of Soya beans costs Rs.70 to prepare requires 8 man days of work
and yields a profit of Rs.20. If the farmer has Rs.1, 00,000 for preparation and can count on 8000 man days of work, how
many acres should be allocated to each crop to maximize the profit?

2.

A company produces two types of cow boy hats .Each hat of the first type requires twice as much labor time as the second
type. If all the hats are of second type only, the company can produce a total of 500 hats a day. The market limit s daily
sales of the first and second types to 150 and 200 hats .Assuming that the profits per hat are Rs.8 for type 1 and Rs.5 for
Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15

type 2 , formulate the problem as a LPP model in order to determine the number of hats to be produced of each type so as
to maximize the profit.
3.

A firm manufactures 3 products A,B and C .The profits are Rs.3 , Rs.2 and Rs.4 respectively. The firm has two machines
and below is the required processing time in minutes for each machine on each product.
Products

Machine

C
D 2

Machines C and D have 2000 and 2500 machine minutes respectively. The firm must

manufacture 100 As 200Bs and

50Cs but not more than 150As. Set up the LPP to maximize the profit.
4.

A firm can produce three types of clothes A, B and C .Three kinds of wool are required for it , say red wool, green wool and
blue wool. One unit length of type A cloth needs 2 yards of red wool and 3 yards of blue wool; one unit length of type B
cloth needs 3 yards of red , 2 yards of green and 2 yards of blue wool; and one unit length of type C needs 5 yards of green
wool and 4 yards of blue wool. The firm has only a stock of 8 yards of red wool, 10 yards of green wool and 15yards of blue
wool. It is seen that the income from one unit length of type A cloth is Rs.3,of type B cloth is Rs.5 and that of type C is
Rs.4.Determine how the firm should use the available material, so as to maximize the total income from the finished cloth.

5.

Formulate the LPP model for the following problem. In a chemical industry two products A and B are made involving two
operations The production of B results also in a by product C.The product A can be sold at Rs3 profit per unit and B at Rs.8
profit per unit. The by product C sells at Rs.2 profit per unit, but it cannot be sold as the destruction cost is Re 1 per unit
.Forecasts show that up to 5 units of C can be sold. The company gets 3 units of C for each unit of B produced. Forecasts
show that they can sell all the units of A and B produced. The manufacturing times are 3 hours per unit for A on operation
one and two respectively and 4 hours and 5 hours per unit for B on operation one and two respectively. Because the product
C results from producing B no time is used I producing C. The available times are 18 and 21 hours of operation one and two
respectively. The company question how much A and B should be produced keeping C in mind to make the highest profit?

6.

A person wants decide the constituents of a diet which will fulfill his daily requirements of proteins, fats and carbohydrates
at the minimum cost. The choice is to be made from different types of foods. The yields per unit of these foods are given in
the following table
Food Type
1
2
3
4
Minimum

Proteins

Yield / Unit
Fats

Carbohydrates

Cost / unit

3
4
8
6
800

2
2
7
5
200

6
4
7
4
700

Rs.
45
40
85
65

Requirement
Formulate the problem as a LPP.
7.

Using Graphical solution solve the following LPP: Max. Z

5 x1 7 x 2 subject to

x1 x 2 4 ; 3 x1 8 x 2 24 ; 10 x1 7 x 2 35 ; x1 , x 2 0.
8.

Using Graphical solutions solve the following LPP: Max. Z

2 x1 x 2 subject to

x1 2 x 2 10 ; x1 x 2 6 ; x1 x 2 2 ; x1 2 x 2 1; x1 , x 2 0.
9.

Using Graphical solutions solve the following LPP: Max. Z

x1 2 x 2 3 ; x1 x 2 4 ; 0 x1
10.

7 x1 3 x 2 subject to

5
3
;0 x 2 ; x1 2 x 2 1; x1 , x 2 0.
2
2

Using Graphical solutions solve the following LPP: Max. Z

2 x1 3x 2 subject to

x1 x 2 30 ; x 2 3 ; 0 x 2 12 ; x1 x 2 0 ; 0 x1 20 ; x1 , x 2 0.
Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15

11. Rewrite in standard form the LPP: Max. Z

12 x1 5 x 2 subject to

5 x1 3 x 2 15 ; 7 x1 2 x 2 14 ; x1 , x 2 0.
12. Rewrite in standard form the LPP: Max. Z

2 x1 x 2 x3 subject to

x1 3 x 2 x 3 20 ; 2 x1 x 2 x 3 12 ; x1 4 x 2 4 x 3 2 ; x1 0 and x 2 & x3 unrsetricted

13. Find all the basic feasible solutions of the equations.

2 x1 6 x 2 2 x3 x 4 3 ; 6 x1 4 x 2 4 x3 6 x 4 2
2 x1 3 x 2 4 x3 7 x 4 subject to

14. Compute all the basic feasible solutions to the LPP Max. Z

2 x1 3 x 2 x3 4 x 4 8 ; x1 2 x 2 6 x3 7 x 4 3 ; xi 0 for every i . Also find the optimal solution.

15. Use Simplex Method to solve the LPP: Max. Z

5 x1 3x 2 subject to

x1 x 2 2 ; 5 x1 2 x 2 10 ; 3 x1 8 x 2 12 ; x1 , x 2 0.
16. Use Simplex Method to solve the LPP: Max. Z

4 x1 10 x 2 subject to

2 x1 x 2 50 ; 2 x1 5 x 2 100 ; 2 x1 3x 2 90 ; x1 , x 2 0.
17. Use Simplex Method to solve the LPP: Max. Z

x1 x 2 3 x3 subject to

x1 x 2 x3 10 ; 2 x1 x3 2 ; 2 x1 2 x 2 3 x3 0 ; x1 , x 2 , x3 0.
18. Use Simplex Method to solve the LPP: Min. Z

x1 3 x 2 2 x3 subject to

3 x1 x 2 2 x3 7 ; 2 x1 4 x 2 12 ; 4 x1 3 x 2 8 x3 10 ; x1 , x 2 , x3 0.
19. Use Simplex Method to solve the LPP: Max. Z

2 x1 3 x 2 subject to

x1 2 x 2 4 ; x1 x 2 6 ; x1 3 x 2 9 ; x1 , x 2 un restricted .
20. Determine an IBFS using NWCR to the following TP
Destinations
Origins
P
Q
R
Demand
21. Determine an IBFS using

A
B
C
2
11
10
1
4
7
3
9
4
3
3
4
LCM to the following

D
3
2
8
5
TP

E
7
1
12
6

Supply
4
8
9

Destinations
Origins
A
1
2
2
1
3
3
Demand
20
22. Determine an IBFS using VAM
1
2
3
Demand
23. Solve the transportation
1
2
3
Demand

B
11
4
9
40
to the

A
B
11
13
16
18
21
24
200 225
problem
1
21
17
32
6

2
16
18
27
10

C
D
10
3
7
2
4
8
30
10
following TP

Supply
30
50
20

C
17
14
13
275

D
14
10
10
250

Supply
250
300
400

3
25
14
18
12

4
13
23
41
15

Supply
11
13
19
Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15

24. Solve the transportation problem

1
2
1
9
12
2
7
3
3
6
5
4
6
8
Demand
4
4
Solve the transportation problem

3
9
7
9
11
6

4
6
7
11
2
2

5
9
5
3
2
4

C
7
20
18
35

D
8
12
9
40

Supply
50
40
70

26.

A
B
1
11
20
2
21
16
3
8
12
Demand
30
25
Solve the transportation problem

27.

A
B
P
6
1
Q
11
5
R
10
12
Demand
85
35
Solve the transportation problem

C
D
Supply
9
3
70
2
8
55
4
7
70
50
45
to maximize the profit.

25.

28.

29.

A
B
1
40
25
2
44
35
3
38
38
Demand
40
20
Solve the transportation problem

C
D
22
33
30
30
28
30
60
30
to maximize the

A
B
C
1
15
51
42
2
80
42
26
3
90
40
66
Demand
23
31
16
Solve the following assignment problem.
1
2
3
4

A
10
5
12
8

B
12
10
14
15

C
19
7
13
11

D
33
81
60
30

6
10
5
11
10
2

Supply
100
30
70
profit.
Supply
23
44
33

D
11
8
11
9

30.

Solve the following assignment problem.

31.

A
B
C
D
E
1
8
4
2
6
1
2
O
9
5
5
4
3
3
8
9
2
6
4
4
3
1
0
3
5
9
5
8
9
5
Solve the following assignment problem to maximize the profit.

32.

A
B
1
38
32
2
40
24
3
41
27
4
22
38
5
29
33
Assign four trucks1,2,3, and 4 to

C
40
28
33
41
40
vacant

Supply
5
6
2
9

D
E
28
40
21
36
30
37
36
36
35
39
spaces A,B,C,D,E and F so that the

distance

minimized. The matrix below shows the distance.

A
B
C

1
4
8
4

2
7
2
9

3
3
5
6

4
7
5
9
Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15

traveled

is

33.

D
7
E
6
F
6
Five workers are available

5
4
8
3
5
4
8
7
3
to work with the machines and the respective

with each worker machine assignment is given

the

below. A sixth machine is available to replace one of the machines and

associated costs are given below. i) Determine whether the machine can be

the optimal assignment and the associated saving

M1
12
4
8
5

W1
W2
W3
W4
W5

M2
3
11
2
7
8

M3
6
10
8
9

Solve the following traveling Sales man problem

35.

1
2
3
4
5
Solve the following traveling

37.

38.

39.

1
2
3
10
25
1
10
8
9
14
10
24
10
8
25
Sales man problem

A
B
A
7
B
7
C
6
8
D
8
5
E
4
6
Calculate the earliest start, earliest finish ,
determine the critical path of the project.
Act
1-2
1-3
1-5
2-3
Dur
8
7
12
4

accepted.

M4
5
9
6
4

M5
5
7
12
6

0-1

Duration: 3

Determine

4
25
5
20
27

5
10
2
10
15
-

M6
8
3
5
10
--

C
D
E
6
8
4
8
5
6
9
7
9
8
7
8
latest start, latest finish of each activity
2-4
10

3-4
3

3-5
5

3-6
10

4-6
7

of the project given below and

5-6
4

The following table indicates the details of the project. The duration is in
times 'm' refers most likely times and 'b' refers to
pessimistic time duration.
Act.
1-2
1-3
1-4
2-4
2-5
3-5
4-5
a
2
3
4
8
6
2
2
m
4
4
5
9
8
3
5
b
5
6
6
11
12
4
7
i) Draw the network ii) Find the critical path. iii) Determine the expected
deviation of the completion time.
The following time-cost table (time in days, cost in rupees) applies to a project .Use
it to arrive at the network associated with computing the project in minimum
time and minimum cost.
Activity
Normal
Crash
Time
Cost
Time
Cost
1-2
2
800
1
1400
1-3
5
1000
2
2000
1-4
5
1000
3
1800
2-4
1
500
1
500
2-5
5
1500
3
2100
3-4
4
2000
3
3000
3-5
6
1200
4
1600
4-5
3
900
2
1600
Determine the Critical path of the following project.
Act:

ii)

cost.

34.

36.

costs (in Rs.) associated

1-2

1-3

2-4

2-5

3-4

3-6

4-7

5-7

6-7

12

(Weeks)
days. 'a' refers optimistic

standard

(weeks)
40

The following table indicates the details of the project. The duration is in
refers most likely times and 'b' refers to
pessimistic time duration.
Act.
1-2
2-3
2-4
3-4
4-5
5-6
a
0.8
3.7
6.2
2.1
0.8
0.9
m
1.0
5.6
6.6
2.7
3.4
1.0
b
1.2
9.9
15.4
6.1
3.6
1.1

days. 'a' refers optimistic times 'm'

Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15

i) Draw the network ii) Find the critical path, expected project length and
variance of the project length iii) Determine the expected
duration and
activity.
41.

expected
standard deviation of each

Calculate the total float, free float and independent float for the project whose activities are given below and determine
the critical path.
Act.
1-2
1-3
1-5
2-3
2-4
3-4
3-5
3-6
4-6
5-6
Duration
8
7
12
4
10
3
5
10
7
4
(Weeks)

*****

Dr.B.Vellaikannan Dept.of Maths TCE ,Madurai 15