INDEX

S.No Date Title Pg. no

1 05/01/2021 Linear programming- Graphical method 1-2

(Maximization)
2 05/01/2021 Linear programming- Graphical method 3-4
(Minimization)
3 05/01/2021 Linear programming- Simplex method 5-6
(Maximization)
4 05/01/2021 Linear programming- Simplex method 7-8
(Minimization)
5 07/01/2021 Linear programming- Big M method 9-11
(Maximization)
6 07/01/2021 Linear programming- Big M method 12-14
(Minimization)
7 07/01/2021 Transportation method- North-West 15-17
Corner Rule
8 07/01/2021 Transportation method- Least Cost 18-19
Method
9 12/01/2021 Transportation method- Vogel’s 20-21
Approximation Method
10 12/01/2021 Assignment Method-Unbalanced 22-23

11 12/01/2021 Assignment Method-Balanced 24-25

12 12/01/2021 Assignment Method- Unbalanced 26-27
13 19/01/2021 Assignment Method- Restricted 28-29
14 19/01/2021 Critical Path Method(CPM) 30-32
15 19/01/2021 Project Evaluation Review 33-34
Technique(PERT)
 Register No. 1913721034112

PROBLEM NO: 1
GRAPHICAL METHOD (MAXIMISATION)
Solve the following LPP by Graphical method
Maximize Z = 3x1 + 2x2
Subject to,

-2x1 + x2  1

x1 + x2  3

x1  2

x1, x2  0

AIM: To maximize the LPP using Graphical Method

ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Linear programming” and then click “Go to input screen”
 Enter the problem title, number of variables, number of constraints and press Enter
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Graphical
 Click on “Go to output screen”
 In the output screen, click on “Click here to graph LP in one stroke”
 The output is displayed

1
 Register No. 1913721034112

OUTPUT:

RESULT:
MAX Z= 8
x1= 2
x2= 1

2
 Register No. 1913721034112

PROBLEM: 2
GRAPHICAL METHOD (MINIMISATION)
Solve the following LPP by Graphical method
Minimize Z = 3x1 + 5x2
Subject to,

-3x1 + 4x2  12

x2  2

2x1 + 3x2  12

x1  4

2x1 – x2  -2

x1, x2  0

AIM: To minimize the LPP using Graphical Method

ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Linear programming” and then click “Go to input screen”
 Enter the problem title, number of variables, number of constraints and press Enter
 Change maximize to minimize – left click
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Graphical
 Click on “Go to output screen”
 In the output screen, click on “Click here to graph LP in one stroke”
 The output is displayed

3
 Register No. 1913721034112

OUTPUT:

RESULT:
MIN Z= 19
x1= 3
x2= 2
4
 Register No. 1913721034112

PROBLEM NO: 3
SIMPLEX METHOD (MAXIMISATION)
Solve the following LPP by Simplex method
Maximize Z = 4x1 + 10x2 subject to

2x1 + x2  50

3x1 + 5x2  100

2x1 + 3x2  90

x1, x2  0

AIM: To maximize the LPP using Simplex Method

ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Linear programming” and then click “Go to input screen”
 Enter the problem title, number of variables, number of constraints and press Enter
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Algebraic – Iterations – All-slack starting
solution
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

5
 Register No. 1913721034112

OUTPUT:

RESULT:
MAX Z= 200
x1= 0
x2= 20

6
 Register No. 1913721034112

PROBLEM NO: 4
SIMPLEX METHOD (MINIMISATION)
Solve the following LPP by Simplex method
Minimize Z = 8x1 - 2x2
Subject to,

-4x1 + 2x2  50

-4x1 + 2x2  1

5x1 - 4x2  90

x1, x2  0

AIM: To minimize the LPP using Simplex Method

ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Linear programming” and then click “Go to input screen”
 Enter the problem title, number of variables, number of constraints and press Enter
 Change maximize to minimize – left click
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Algebraic – Iterations – All-slack starting
solution
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

7
 Register No. 1913721034112

OUTPUT:

RESULT:
MIN Z= -1
x1= 0
x2= 0.50

8
 Register No. 1913721034112

PROBLEM NO: 5
BIG M METHOD (MAXIMISATION)
Use Big M Method to solve the following LPP

Max Z = 2x1+x2 ,
Subject to,

x1+x2 ≤ 5,

2x1+3x2 = 12

x1, x2 ≥0

AIM: To maximize the LPP using Big M Method

ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Linear programming” and then click “Go to input screen”
 Enter the problem title, number of variables, number of constraints and press Enter
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Algebraic – Iterations – M Method
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

9
 Register No. 1913721034112

OUTPUT:

10
 Register No. 1913721034112

RESULT:
MAX Z= 8
x1= 3
x2= 2
x3= 0

11
 Register No. 1913721034112

PROBLEM N0: 6
BIG M METHOD (MINIMISATION)
Solve the following LPP by Big M method
Minimize Z = 4x1 + 3x2
Subject to,

2x1 + x2  10

-3x1 + 2x2  6

x1 + x2  6

x1, x2  0

AIM: To minimize the LPP using Big M Method

ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Linear programming” and then click “Go to input screen”
 Enter the problem title, number of variables, number of constraints and press Enter
 Change maximize to minimize – left click
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Algebraic – Iterations – M Method
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

12
 Register No. 1913721034112

OUTPUT:

13
 Register No. 1913721034112

RESULT:
MIN Z= 22
x1= 4
x2= 2

14
 Register No. 1913721034112

PROBLEM N0: 7
TRANSPORTATION MODEL (NORTH-WEST CORNER RULE)
Solve the following transportation problem using North-West Corner Rule

D1 D2 D3 D4 D5
S1 2 11 10 3 7 4
S2 1 4 7 2 1 8
S3 3 9 4 8 12 9
3 3 4 5 6

AIM: To find the optimal solution for the above problem using North-West Corner Rule
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, number of sources, number of destinations and press Enter
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Iterations – North-West Corner Rule
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

15
 Register No. 1913721034112

OUTPUT:

16
 Register No. 1913721034112

RESULT:
Iteration 8 is optimal
Initial Basic Cost and Optimum Solution = Rs.153

17
 Register No. 1913721034112

PROBLEM N0: 8
TRANSPORTATION MODEL (LEAST COST METHOD)
Solve the following transportation problem using Least Cost Method

D1 D2 D3 D4
S1 1 2 1 4 30
S2 3 3 2 1 50
S3 4 2 5 9 20
20 40 30 10

AIM: To find the optimal solution for the above problem using Least Cost Method
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, number of sources, number of destinations and press Enter
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Iterations – Least Cost Method
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

18
 Register No. 1913721034112

OUTPUT:

RESULT:
Iteration 1 is optimal
Initial Basic Cost and Optimum Solution = Rs.180

19
 Register No. 1913721034112

PROBLEM N0: 9
TRANSPORTATION MODEL (VOGEL’S APPROXIMATION METHOD)
Solve the following transportation problem using Vogel’s Approximation Method

D1 D2 D3 D4
S1 21 16 25 13 11
S2 17 18 14 23 13
S3 32 27 18 41 19
6 10 12 15

AIM: To find the optimal solution for the above problem using Vogel’s Approximation Method
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, number of sources, number of destinations and press Enter
 Enter all the values in the given box
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Iterations –Vogel’s Approximation
Method
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

20
 Register No. 1913721034112

OUTPUT:

RESULT:
Iteration 1 is optimal
Initial Basic Cost and Optimum Solution = Rs.796
21
 Register No. 1913721034112

PROBLEM N0: 10
TRANSPORTATION PROBLEM (UNBALANCED)
Solve the following transportation problem

6 1 9 3 70
11 5 2 8 55
10 12 4 7 70
85 35 50 45

AIM: To find the optimal solution for the above unbalanced transportation problem
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, convert the unbalanced problem into balanced problem by making
number of sources and number of destinations to be equal and type the number of sources,
number of destinations and press Enter
 Enter all the values in the given box with dummy row or column having the cost as 0 as the
problem is of unbalanced type
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Iterations –Vogel’s Approximation
Method
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

22
 Register No. 1913721034112

OUTPUT:

RESULT:
Iteration 2 is optimal
Initial Basic Cost = Rs. 1010
Optimum Solution = Rs.960
23
 Register No. 1913721034112

PROBLEM N0: 11
ASSIGNMENT PROBLEM (BALANCED)
Solve the following Assignment problem

M1 M2 M3 M4 M5
J1 9 22 58 11 19
J2 43 78 72 50 63
J3 41 28 91 37 45
J4 74 42 27 49 39
J5 36 11 57 22 25

AIM: To find the minimum cost for the above problem by Assignment Method
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, number of sources, number of destinations and press Enter
 Enter all the values in the given box with supply and demand =1
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Final solution
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

24
 Register No. 1913721034112

OUTPUT:

RESULT:
Optimum Assignment Schedule= J1- M4, J2- M1, J3- M2, J4- M3, J5-M5
Optimum Solution = Rs.134

25
 Register No. 1913721034112

PROBLEM N0: 12
ASSIGNMENT PROBLEM (UNBALANCED)
Solve the following Assignment problem

1 2 3 4
A 18 24 28 32
B 8 13 17 19
C 10 15 19 22

AIM: To find the minimum cost for the above problem by Assignment Method
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, convert the unbalanced problem into balanced problem by making
number of sources and number of destinations to be equal and type the number of sources,
number of destinations and press Enter
 Enter all the values in the given box with supply and demand =1with unit cost 0 for dummy
row or column
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Final solution
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

26
 Register No. 1913721034112

OUTPUT:

RESULT:
Optimum Assignment Schedule= A-1, D1-4, B-2, C-3
Optimum Solution = Rs.50

27
 Register No. 1913721034112

PROBLEM N0: 13
ASSIGNMENT PROBLEM RESTRICTED)
Solve the following Assignment problem

M1 M2 M3 M4 M5 M6
A 12 3 6 - 5 8
B 4 11 - 5 - 3
C 8 2 10 9 7 5
D - 7 8 6 12 10
E 5 8 9 4 6 -

AIM: To find the minimum cost for the above problem by Assignment Method
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Transportation Model” and then click “Go to input screen”
 Enter the problem title, convert the unbalanced problem into balanced problem by making
number of sources and number of destinations to be equal and type the number of sources,
number of destinations and press Enter
 Enter all the values in the given box with supply and demand =1with unit cost 0 for dummy
row or column
 Enter some high value like 100 in the cells where no values are given
 Click on the solve menu and press “no” on the save dialogue box
 In the Solve/Modify click on the Solve Problem – Final solution
 Click on “Go to output screen”
 In the output screen, click on “All Iterations”
 The output is displayed

28
 Register No. 1913721034112

OUTPUT:

RESULT:
Optimum Assignment Schedule= A- M5, B- M6, C- M2, D- M4, E -M1, F-M3
Optimum Solution = Rs.21

29
 Register No. 1913721034112

PROBLEM N0: 14
CRITICAL PATH METHOD
Calculate the Critical Path, Total Float (TF), Free Float (FF) for the following project

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

AIM: To calculate the Critical Path, Total Float (TF) and Free Float (FF) for the given problem
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Project Planning” – Critical Path Method and then click “Go to
input screen”
 Enter the problem title as CPM and press Enter
 Enter all the values in the input grid
 Click on the solve menu and press “no” on the save dialogue box
 Click on “Go to output screen”
 In the output screen, click on “CPM Chart”
 The output is displayed

30
 Register No. 1913721034112

OUTPUT:

31
 Register No. 1913721034112

RESULT:
Critical path: 1 → 2 → 4 → 7 → 8
Estimated Project Length= 31 Weeks

TF 0 9 0 9 14 8 0 8 14 0
FF 0 0 0 1 0 0 0 8 14 0

32
 Register No. 1913721034112

PROBLEM N0: 15
PROGRAMME EVALUATION REVIEW TECHNIQUE (PERT)
Calculate the Critical path, Expected project duration, Standard deviation and Variance of the
project for the following data

ACTIVITY a m b
1-2 3 4 5
2-3 1 2 3
2-4 2 3 4
3-5 3 4 5
4-5 1 3 5
4-6 3 5 7
5-7 4 5 6
6-7 6 7 8
7-8 2 4 6
7-9 1 2 3
8-10 4 6 8
9-10 3 5 7

AIM: To calculate the Critical Path, Total Float (TF) and Free Float (FF) for the given problem
ALGORITHM:
 Click on the Start- All Programs –TORA
 Click on “Click here” on the first page
 In the main menu click “Project Planning” – Programme Evaluation Review Technique and
then click “Go to input screen”
 Enter the problem title as CPM and press Enter
 Enter all the values in the input grid
 Click on the solve menu and press “no” on the save dialogue box
 Click on “Go to output screen”
 In the output screen, click on “CPM Chart”
 The output is displayed

33
 Register No. 1913721034112

OUTPUT:

RESULT:
Critical path: 1 → 2 → 4 → 6 →7 → 8 →10
Estimated Project Length= 29 Days

Standard Deviation = 1.29 variance = 1.67

34