SRM INSTITUTE OF SCIENCE

AND
TECHNOLOGY
Kattankulathur,Chennai-603203.

FACULTY OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF MATHEMATICS

Academic Year(2020–2021)

18MAB261J -OPERATIONS RESEARCH

SEMESTER–II

NAME: ANUSHKA S

REG NO.: RA1911042010019

CLASS: B.TECH(CSE)

YEAR: II YEAR

SECTION : CSBS-A R1
 SRM INSTITUTE OF SCIENCE AND
TECHNOLOGY
Kattankulathur,Chennai-603203 .
FACULTY OF ENGINEERING AND TECHNOLOGY
DEPARTMENT OF MATHEMATICS

R A 1 9 1 1 0 4 2 0 1 0 0 1 9

BONAFIDE CERTIFICATE
Certified that this is the bonafide record of work done by ANUSHKA S of IV semester
B.Tech COMPUTER SCIENCE AND ENGINEERING during the academic year
2020-2021 in the 18MAB261J -OPERATIONS RESEARCH Laboratory.

------------------------------ -----------------------------------
Dr. Lavanya G HOD/Mathematics
Staff -Incharge

Submitted for the practical examination held on____________ at SRM Institute of

Science and Technology,Kattankulathur,Chennai-603203.

---------------------------------- -------------------------------

Examiner-1 Examiner-2
 INDEX
S.NO Date NAME OF EXPERIMENT Page Signature
No.
1

11/03/21 GRAPHICAL METHOD

2

18/03/21 SIMPLEX LP
3

18/03/21 SIMPLEX LP
4

25/03/21 BIG-M
5

12/04/21 TRANSPORTATION
6

12/04/21 TRANSPORTATION
7

15/04/21 ASSIGNMENT
8

15/04/21 ASSIGNMENT
9

20/04/21 CPM
10

20/04/21 CPM
11

20/04/21 PERT
12

27/04/21 QUEUING ANALYSIS

 18MAB261J-OPERATIONS RESEARCH
Practical lab-1
GRAPHICAL METHOD

AIM: - Use graphical method to solve

Minimum Z=11X=3Y
C1) 4X+Y>=12
C2) 2X+2Y>=18
C3) 4X-5Y>=0
X,Y>=0

PROCEDURE: -
1. Enter the variables X and Y, then the objective function Z coefficient
2. Enter the coefficients of the constraints C1 C2 and C3 by side introduce
inequalities and then enter the RHS
3. Find the points of intersection of the constraints with the coordinate axis to
draw constraint lines.
4. Type C1 X Y values When X=0 Y=? And when Y=0 X=? for constraint C1 say this
is (0,y1) and (x1,0) repeat this for all the constraints.
5. If the RHS of the constraint is zero choose some value other than 0 for x and
then find y, the other [opnt may be (0,0)
6. Highlight C1 points click on insert-scatter-scatter with straight lines.
7. 7.Clock on series one and clock edit series name C1 Series X value (0,3) and
(12.0) refer to the next sheet for these values. Click ok, add continue for all
constraints.
 8. Go to insert -shapes-textbox, click and drag. To shade the feasible region click
insert shapes- freeform click on corner points on the feasible region to cover
the area.
9. Name the corner points.To find the corner points consider the point A it is
intersection of C1 and C2 Copy and paste constraints C1 and C2 type X y and Z
one below the other as shown in the sheet graphical
10.Select X and Y=MMULT(MINVERSE((SELECT COEFFICIENTS), SELECT RHS))
11.Do not press enter Hold downCtrl+shift +enter this gives the coordinates of A.
12.Similarly repeat for the other coordinates of the corner points.

RESULT: -
The feasible region with graph is given below-
 18MAB261J-OPERATIONS RESEARCH
Practical lab-2
SIMPLEX LP

AIM: - Maximize Z=2x+y+z

subject to 4x+6y+3z<=8
3x-6y-4z<=1
2x+3y-5z>=4
x, y, z>=0
PROCEDURE:-
1. Write down the decision variables, coefficient value and values, which is assumed
as 1 as a solution for both the variables.
2. Then objective value is calculated using sumproduct by taking arrays of assumed
values and coefficient
3. Constraints are written down with coefficient, LHS, RHS and relation. LHS is
calculated using a sumproduct of arrays of coefficient of that constraint and
assumed value.
4. It is repeated for all the constraints
5. Once all the constraints are defined, the problem is solved using excel solver 6.
Take the solver option under the data menu and the objective is set as objective
value.
7. Maximize or minimize option is selected according to the question.
8. Assumed values are selected as the variable cells.
9. Each constraint is added with cell reference as LHS, then relation and constraint
as RHS.
10.After defining everything, simplex lp is selected as the solving method.
11.Finally click solve and select both answer and sensitivity under the report criteria
BEFORE-

AFTER-
RESULT: -
Both answer report and sensitivity report are generated
ANSWER REPORT

SENSITIVITY REPORT
 18MAB261J-OPERATIONS RESEARCH
Practical lab-3
SIMPLEX LP

AIM: - Maximize Z=3x+2y +5z

subject to x+4y<=420
3x+2z<=460
x+2y+z<=430
x, y ,z>=0
PROCEDURE: -
1. Write down the decision variables, coefficient value and values, which is assumed
as 1 as a solution for both the variables.
2. Then objective value is calculated using sumproduct by taking arrays of assumed
values and coefficient
3. Constraints are written down with coefficient, LHS, RHS and relation. LHS is
calculated using a sumproduct of arrays of coefficient of that constraint and
assumed value.
4. It is repeated for all the constraints
5. Once all the constraints are defined, the problem is solved using excel solver
6. Take the solver option under the data menu and the objective is set as objective
value.
7. Maximize or minimize option is selected according to the question.
8. Assumed values are selected as the variable cells.
9. Each constraint is added with cell reference as LHS, then relation and constraint as
RHS.
 10. After defining everything, simplex lp is selected as the solving method.
11. Finally click solve and select both answer and sensitivity under the report criteria

BEFORE-

AFTER-
RESULT: -
Both answer report and sensitivity report are generated
ANSWER REPORT

SENSITIVITY REPORT
 18MAB261J-OPERATIONS RESEARCH
Practical lab-4
BIG-M

AIM: - Use penalty (Big-M) method to solve the following LP problem.

Maximize Z = x1 + 2x2 + 3x3 – x4
Subject to the constraints
(i) x1 + 2x2 + 3x3>= 15,
(ii) 2x1 + x2 + 5x3 = 20,
(iii) x1 + 2x2 + x3 + x4 = 10 and x1, x2, x3, x4 ≥ 0.
PROCEDURE: -
1. Write down the decision variables, coefficient value and values, which is assumed
as 1 as a solution for both the variables.
2. Then objective value is calculated using sumproduct by taking arrays of assumed
values and coefficient
3. Constraints are written down with coefficient, LHS, RHS and relation. LHS is
calculated using a sumproduct of arrays of coefficient of that constraint and
assumed value.
4. It is repeated for all the constraints
5. Once all the constraints are defined, the problem is solved using excel solver
6. Take the solver option under the data menu and the objective is set as objective
value.
7. Maximize or minimize option is selected according to the question.
8. Assumed values are selected as the variable cells.
9. Each constraint is added with cell reference as LHS, then relation and constraint as
RHS.
 10. After defining everything, simplex lp is selected as the solving method.
11. Finally click solve and select both answer and sensitivity under the report criteria

Before-

AFTER-
RESULT: -
Both answer report and sensitivity report are generated
ANSWER REPORT

SENSITIVITY REPORT
 18MAB261J-OPERATIONS RESEARCH
Practical lab-5
TRANSPORTATION PROBLEM(BALANCED)

AIM: - Solve the following balanced transportation problem

PROCEDURE
1 A TRANSPORTATION PROBLEM WILL HAVE SOME SOURCES AND SOME SINKS
2 Source is denoted by factory in the example and sink as godowns
3 Each sink will have maximum demand and each source a maximum capacity.
4 There will be a fixed cost of transporting one unit of material from the ith source
to the jth sink, express this in a tabular form.
5 The supplies are given by the side of this table and the demand at the bottom.
6 Decision variables are the quantity of material transported from the ith source to
the jth destination
7 Total number of decision variables= no of rows ×number of columns say ij
8 CONSTRAINTS: Total supply from the source is limited and total demand from the
sinks is also limited. The number of constraints = i+j
9 To solve, copy paste the tabular structure. Delete the entries in(I,j) positions of the
table.
10 Cut the cell under capacity and paste one column apart
11 Cut the cell under demand and paste row column apart
12 The supply from source one would be the sum of the supplies to each of the j
sources i.e., select all the cells in the first row corresponding to the first source and
use the SUM function. Repeat for all rows.
13 Supply at the j sources will be the sum of the supplies from the I source use SUM
function to calculate this for all columns.
14 For the Objective function use SUMPRODUCT(unit cost, quantity of material
shift) in excel.
15 Click on the solver, target cell is the total cost.
16 Choose, minimize, add all the constraints. Material shift<=capacity and total
material reaching the destination is equal to demand.
17 Go to options select LPP and non-negativity.
18 Click on the solver, target cell is the total cost, which gives the minimum cost of
transportation.
19 The cells (I,j) show the number of units transported from each source to
destination.Generate report.
BEFORE-

AFTER-
RESULT: -
The report of following problem is given below-
 18MAB261J-OPERATIONS RESEARCH
Practical lab-6
TRANSPORTATION PROBLEM(UNBALANCED)

AIM: - Solve the above unbalanced transportation problem.

PROCEDURE: -
1 A TRANSPORTATION PROBLEM WILL HAVE SOME SOURCES AND SOME SINKS
2 Source is denoted by factory in the example and sink as godowns
3 Each sink will have maximum demand and each source a maximum capacity.
4 There will be a fixed cost of transporting one unit of material from the ith source
to the jth sink, express this in a tabular form.
5 The supplies are given by the side of this table and the demand at the bottom.
6 Decision variables are the quantity of material transported from the ith source to
the jth destination
7 Total number of decision variables= no of rows ×number of columns say ij
8 CONSTRAINTS: Total supply from the source is limited and total demand from the
sinks is also limited. The number of constraints = i+j
9 To solve, copy paste the tabular structure. Delete the entries in(I,j) positions of the
table.
10 Cut the cell under capacity and paste one column apart
11 Cut the cell under demand and paste row column apart
12 The supply from source one would be the sum of the supplies to each of the j
sources i.e., select all the cell in the first row corresponding to first source and use
the SUM function. Repeat for all rows.
13 Supply at the j sources will be the sum of the supplies from the I source use SUM
function to calculate this for all columns.
14 For the Objective function use SUMPRODUCT(unit cost, quantity of material
shift) in excel.
15 Click on the solver, target cell is the total cost.
16 Choose, minimize, add all the constraints. Material shift<=capacity and total
material reaching the destination is equal to demand.
17 Go to options select LPP and non-negativity.
18 Click on the solver, target cell is the total cost, which gives the minimum cost of
transportation.
19 The cells (I,j) show the number of units transported from each source to
destination. Generate report.
BEFORE-

AFTER-
RESULT: -
The report of the problem is given below-
 18MAB261J-OPERATIONS RESEARCH
Practical lab-7
ASSIGNMENT PROBLEM

AIM: - Solve the above assignment problem.

PROCEDURE: -
1. Enter the values in the excel and make table t1.
2. Copy the values to another table t2 and take the sum of each row and
column and delete all the values from it.
3. Now find the sum product of t1 and t2.
4. Take the solver , set objective as the sumproduct, set to min
5. Select first constraint as table t2 and equal to binary
6. Second and third constraints will be sum both row wise and column wise
equal to 1.
7. Select the solving method as simplex lp and click solve
BEFORE-

AFTER-
RESULT: -
The report of the problem is given below-
ANSWER REPORT
 18MAB261J-OPERATIONS RESEARCH
Practical lab-8
ASSIGNMENT PROBLEM

AIM:-A department head has four tasks and three subordinates who
differ in efficiency. The estimate of time each subordinate
would take to perform is given below in the matrix. How should
he dedicate the tasks one to each man so as to minimize the total
man hours?

PROCEDURE:-
1. Enter the values in the excel and make table t1.
2. Copy the values to another table t2 and take the sum of each row and column
and delete all the values from it. 10.Now find the sumproduct of t1 and t2.
3. Take the solver , set objective as the sumproduct, set to min
4. Select first constraint as table t2 and equal to binary
5. Second and third constraints will be sum both row wise and column wise equal to
1.
6. Select the solving method as simplex lp and click solve
BEFORE-

AFTER-
RESULT: -
The report of the problem is given below-
ANSWER REPORT
 18MAB261J-OPERATIONS RESEARCH
Practical lab-9
CRITICAL PATH METHOD

AIM: - A project consists of a series of tasks labelled A, B, …,I with the

following relationships (W<X,Y means that X and Y cannot start until W is
completed.) with this notation given the following data A<D, E; B, D<F; C<G;
B<H; F,G<I Find the minimum time of completion of the project when the
time in days of completion of each task is as follows:

Task A B C D E F G H I

Time 23 8 20 16 24 18 19 4 10

PROCEDURE: -

1. Click on TORA tab

2. Select the main menu and choose project planning.

3. Select CPM (or PERT) as per requirement.

4. Click on “Go to input screen”.

5. Give the problem title” Lab 9”and press

enter.

6. Fill relevant data in the input grid that pops up and

click on the solve menu.

7. Click on save button that appears.

8. Go to output screen select CPM calculation from

out put options and click on all steps.

9. You observe that the complete output is displayed.

10. Click on “write to printer” and save the output file.

11. The out is saved as pdf with the critical events

indicated by the letter C by the side.

RESULT: -

Both CPM Calculations report and CPM Bar Chart report are generated

CPM CALCULATIONS REPORT

CPM BAR CHART REPORT

The above tables show that the critical activities are 1-2, 2-3, 3-5, 5-6 as
their total float is zero. Hence, we have the critical path, 1-2-3-5-6 with the
total project duration. The least possible time to complete the entire project is
67 days.
 18MAB261J-OPERATIONS RESEARCH
Practical lab-10
CRITICAL PATH METHOD
AIM: -

To calculate the total float and free float for the project whose activities
are given below.

ACTIVITY SYMBOL DURATION

1-2 A 8

1-3 B 7

1-5 C 12

2-3 D 4

2-4 E 10

3-4 F 3

3-5 G 5

3-6 H 10

4-6 I 7

5-6 J 4
PROCEDURE: -

1. Click on TORA tab

2. Select main menu and choose project planning.

3. Select CPM (or PERT) as per requirement.

4. Click on “Go to input screen”.

5. Give the problem title” CPM-problem 1”and press enter.

6. Fill relevant data in the input grid that pops up and click on solve
menu.

7. Click on save button that appears.

8. Go to output screen select CPM calculation from out put options and
click on all steps.

9. You observe that the complete output is displayed.

10. Click on “write to printer” and save the output file.

11. The out is saved as pdf with the critical events indicated by the
letter C by the side.
RESULT: -
 18MAB261J-OPERATIONS RESEARCH
Practical lab-11
PROJECT EVALUATION AND REVIEW
TECHNIQUE

AIM: -

To solve the PERT problem, find the critical path and determine the
expected standard deviation of the completion time.

The table given below indicates the details of the project. The duration
is in days. ‘a’ refers to optimistic time, ’m’ refers to most likely time and
‘b’ refers to pessimistic time duration.

ACTIVITY SYMBOL a m b

1-2 A 2 4 5

1-3 B 3 4 6

1-4 C 4 5 6

2-4 D 8 9 11

2-5 E 6 8 12

3-4 F 2 3 4

4-5 G 2 5 7
PROCEDURE: -

1. Click on TORA tab

2. Select main menu and choose project planning.

3. Select CPM (or PERT) as per requirement.

4. Click on “Go to input screen”.

5. Give the problem title” CPM-problem 1”and press enter.

6. Fill relevant data in the input grid that pops up and click on solve
menu.

7. Click on save button that appears.

8. Go to output screen select CPM calculation from out put options and
click on all steps.

9. You observe that the complete output is displayed.

10. Click on “write to printer” and save the output file.

11. The out is saved as pdf with the critical events indicated by the
letter C by the side.
RESULT: -
 18MAB261J-OPERATIONS RESEARCH
Practical lab-12
QUEUING ANALYSIS
AIM: -

To solve the following queueing analysis questions using TORA software..

1. a. In (M:M:1)/(Infinity: FIFO), if arrival rate is 6 customers per minute

and service rate 8 customers per minutes, then, determine

(a) Traffic intensity

(b) Average number of customers in the queue

(c) Average number of customers in the system

(d) Average waiting time of customers in the queue

(e) Average waiting time of customers in the system.

2. b. In (M:M:1)/(N: FIFO), if arrival rate is 20 customers per minute and

service rate 60 customers per minutes, and the system capacity is 30
then, determine

(a) Traffic intensity

(b) Average number of customers in the queue

(c) Average number of customers in the system

(d) Average waiting time of customers in the queue

(e) Average waiting time of customers in the system

3. In (M:M:s)/(infinity: FIFO), if arrival rate is 15 customers per minute
and service rate 6 customers per minutes, and the number of servers is 3
then, determine

(a) Traffic intensity

(b) Average number of customers in the queue

(c) Average number of customers in the system

(d) Average waiting time of customers in the queue

(e) Average waiting time of customers in the system

4. In (M:M:s)/(k: FIFO), if arrival rate is 4 customers per minute and

service rate 5 customers per minutes, and the number of servers is 2 with
system capacity 7 then, determine

(a) Traffic intensity

(b) Average number of customers in the queue

(c) Average number of customers in the system

(d) Average waiting time of customers in the queue

(e) Average waiting time of customers in the system

PROCEDURE: -

The given questions may be tabulated as follows:

SCENARIO LAMBDA MU NUMBER SYSTEM SOURCE

OF LIMIT LIMIT
SERVER
S

1 6 8 1 INFINITY INFINITY

2 20 60 1 30 INFINITY

3 15 6 3 INFINITY INFINITY

4 4 5 2 7 INFINITY

Procedure for solving:

1. Click on TORA tab

2. Select main menu and choose queueing analysisfrom the main

menu.

3. Click on “Go to input screen”.

4. Give the problem title” Queueing- problem 1”and press enter.

5. Mention the number of scenarios. (problems you want to do

simultaneously).

6. If the scenario is given as ‘1’ then the input table is displayed for
a single problem. If the scenario is given as’4’ then we get the table for
entering the data for all the 4 problems. They may be different models
as shown in the output.
7. Fill relevant data in the input grid that pops up and click on solve
menu.

8. Click on save button that appears.

9. Go to output screen select scenario 1 from out put options then

the result of the first problem is displayed separately.

10. If you choose comparative analysis the result for all the four
problems is displayed in a single table.

11. Click on “write to printer” and save the output file.

RESULT: -

Scenario 1
Scenario-2
Scenario-3
Scenario-4

Comparative Analysis-