SKILL ENHANCEMENT COURSE – I

TORA(OPERATIONS RESEARCH SOFTWARE)

Ex.No: 1: Linear Programming Problem(Graphical Method)

Solve the following LPP by graphical method.

Maximize Z=4X1 +3X2

Subject to the constraints

2 X1 + X2 ≤ 1000

X1 + X2 ≤ 800

X1, X2 ≥ 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select Linear Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose Graphical option for graphical method.

Step 10: Go to output screen.

Step 11:Click , Graph LP Option.

Step 12: Output will appear.

Step 13: Exit TORA.

Ex.No:2 : Linear Programming Problem(Graphical Method)

Solve the following LPP by graphical method.

Maximize Z=20X1 +40X2

Subject to the constraints

36 X1 +6 X2 ≥108

3X1 +12 X2 ≥ 36

20X1 +10 X2 ≥ 100

X1, X2 ≥ 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select Linear Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose Graphical option for graphical method.

Step 10: Go to output screen.

Step 11:Click , Graph LP Option.

Step 12: Output will appear.

Step 13: Exit TORA.

Ex.No:3 : Linear Programming Problem(Graphical Method)

Solve the following LPP by graphical method.

Maximize Z=2X1 +3X2

Subject to the constraints

X1 + X2 ≤ 30

X1 - X2 ≥ 0

X1 ≤ 20

X2 ≤ 12

X1, X2 ≥ 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select Linear Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose Graphical option for graphical method.

Step 10: Go to output screen.

Step 11:Click , Graph LP Option.

Step 12: Output will appear.

Step 13: Exit TORA.

Ex.No: 4: Linear Programming Problem(Simplex Method)

Solve the following LPP by simplex method.

Minimize Z=X1 -3X2 +2X3

Subject to the constraints

3X1 - X2 + 2X3 ≤ 7

-2X2 + 4X3 ≤ 12

-4X1 +3X2 + 8X3 ≤ 10

X1, X2 , X3 ≥ 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select Linear Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose Algebraic Solution to solve Simplex method.

Step 10: Select iteration to see the iteration table.

Step 11: Select Final solution to see the output.

Step 12: Go to output screen to see the output.

Step 13: Output will appear.

Step 14: Exit TORA.

Ex.No: 5: Linear Programming Problem(Big M Method)

Solve the following LPP by Big M method.

Minimize Z=X1 +X2

Subject to the constraints

2X1 + X2 ≥ 4

X1 +7X2 ≥ 7

X1, X2 ≥ 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select Linear Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose Algebraic Solution to solve Big M method.

Step 10: Select iteration to see the iteration table.

Step 11: Select Final solution to see the output.

Step 12: Go to output screen to see the output.

Step 13: Output will appear.

Step 14: Exit TORA.

Ex.No: 6: Linear Programming Problem(Two Phase Simplex Method)

Solve the following LPP by Two Phase Simplex method.

Minimize Z=6X1 +4X2

Subject to the constraints

2X1 + 3X2 ≤ 30

3X1 +2X2 ≤ 24

X1 + X2 ≥ 3

X1, X2 ≥ 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select Linear Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose Algebraic Solution to solve Two Phase Simplex method.

Step 10: Select iteration to see the iteration table.

Step 11: Select Final solution to see the output.

Step 12: Go to output screen to see the output.

Step 13: Output will appear.

Step 14: Exit TORA.

Ex.No: 7: Integer Programming Problem(Pure integer)

Solve the following Integer Programming Problem.

Maximize Z=2X1 +2X2

Subject to the constraints

5X1 + 3X2 ≤ 8

3X1 +2X2 ≤ 4

X1, X2 ≥ 0 and are integers.

Algorithm:

Step 1: Open TORA Software.

Step 2: Select integer Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints also select X1 and X2 as integer option.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose user guided B&B option.

Step 10: Select B&B Search Tree.

Step 11: Select the appropriate option in the window with all inter solution..

Step 12: Output will appear.

Step 13: Exit TORA.

Ex.No:8: Integer Programming Problem( Mixed integer)

Solve the following Integer Programming Problem.

Maximize Z=7X1 +9X2

Subject to the constraints

-X1 + 3X2 ≤ 6

7X1 +X2 ≤ 35

X1, X2 ≥ 0 and X1 is an integer.

Algorithm:

Step 1: Open TORA Software.

Step 2: Select integer Programming.

Step 3: Goto input screen.

Step 4: Give problem title, number of variables and number of constraints information then
press enter.

Step 5: Input Grid window will open. Enter Object function co.efficients and co.efficients of
constraints also select X1 as integer and X2 as non integer option.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Choose user guided B&B option.

Step 10: Select B&B Search Tree.

Step 11: Select the appropriate option in the window with all inter solution..

Step 12: Output will appear.

Step 13: Exit TORA.

Ex.No:9: Game Theory(with saddle point)

Solve the game whose pay off matrix is given by

Player B

15 2 3

Player A 6 5 7

-7 4 0

Algorithm:

Step 1: Open TORA Software.

Step 2: Select zero sum game.

Step 3: Goto input screen.

Step 4: Give problem title, number of strategies of A and number of strategies of B and press
enter.

Step 5: Input Grid window will open. Enter Player A and Player B values.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Output will appear.

Step 10: Exit TORA.

Ex.No:10: Game Theory(without saddle point)

Solve the game whose pay off matrix is given by

Player B

6 8 6

Player A 4 12 2

Algorithm:

Step 1: Open TORA Software.

Step 2: Select zero sum game.

Step 3: Goto input screen.

Step 4: Give problem title, number of strategies of A and number of strategies of B and press
enter.

Step 5: Input Grid window will open. Enter Player A and Player B values.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, press enter.

Step 9: Output will appear.

Step 10: Exit TORA.

Ex.No:11: Game Theory(Graphical Method)

Solve the game graphically whose pay off matrix is given by

Player B

3 -3 4

Player A -1 1 -3

Algorithm:

Step 1: Open TORA Software.

Step 2: Select zero sum game.

Step 3: Goto input screen.

Step 4: Give problem title, number of strategies of A and number of strategies of B and press
enter.

Step 5: Input Grid window will open. Enter Player A and Player B values.

Step 6: Select solve menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8: Then solve problem option will open, choose graphical method and press enter.

Step 9: Goto output Screen.

Step 10:Output will appear.

Step 11: Exit TORA

Ex.No:12: Queueing Theory

A T.V repairman finds that the time spent on his jobs has an exponential distribute with mean 30
minutes. If he repairs sets in the order in which they came in, and if the arrival of sets is
approximately Poisson with an average rate of 10 per 8 hour day, what is repairman’s expected
idle time each day? Also compute

i. Average number of customers in the system.

ii. Average number of customers in the queue.

iii. Average time of customer in the queue.

iv. Average time of customer in the system.

Algorithm:

Step 1: Open TORA Software.

Step 2: Select zero sum game.

Step 3: Goto input screen.

Step 4: Give problem title, number of scenarios and press enter.

Step 5: Enter lamda and mu values.

Step 6: Select solve problem menu.

Step 7: Then this option will open. Do you wish to save data? Yes/No , Press Yes to save.

Step 8:. Goto output Screen.

Step 9: Select comparative analysis option

Step 10: Output will appear.

Step 11: Exit TORA