A

Practical Work Report

ON

QUANTITATIVE ANALYSIS II
NUMERICALS SOLUTION USING TORA & MS EXCEL

Submitted by
Charadva Mohit K. Enrolment No. 168050592507
Dhanani Ronak H. Enrolment No. 168050592520

Subject:
Quantitative Analysis - II [2820007]

Submitted to:
Ms. Rupal Khambhati
Asst. Professor

MBA SEMESTER II

S.R. LUTHRA INSTITUTE OF MANAGEMENT 805

MBA PROGRAMME
Affiliated to Gujarat Technological University
Ahmedabad
April, 2017
Q1. Solution using TORA Optimization System for Optimization of reach to
customers via various sources of Advertisements.

TORA Optimization System, Windows-version 2.00

Copyright 2000-2007 Hamdy A. Taha. All Rights Reserved
Sunday, April 09, 2017 19:35

LINEAR PROGRAM -- ORIGINAL DATA

Title: Q1 for CEC Report of QA - II by Group 7 of Class A2

No of No of
x1 x2
Maximize 500000.00 300000.00
Subject to
( 1) 50000.00 20000.00 <= 210000.00
( 2) 1.00 0.00 >= 3.00
( 3) 0.00 1.00 <= 5.00

Lower Bound 0.00 0.00

Upper Bound infinity infinity
Unrestr'd (y/n)? n n
SIMPLEX TABLEAUS -- (Two-Phase Method)

Title: Q1 for CEC Report of QA - II by Group 7 of Class A2

Phase 1 (Iter 1 No of No of
Basic x1 x2 Sx3 sx4
z (min) 1.00 0.00 -1.00 0.00
sx4 50000.00 20000.00 0.00 1.00
Rx5 1.00 0.00 -1.00 0.00
sx6 0.00 1.00 0.00 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution

z (min) 0.00 0.00 3.00
sx4 0.00 0.00 210000.00
Rx5 1.00 0.00 3.00
sx6 0.00 1.00 5.00

Phase 1 (Iter 2 No of No of
Basic x1 x2 Sx3 sx4
z (min) 0.00 0.00 0.00 0.00
sx4 0.00 20000.00 50000.00 1.00
x1 1.00 0.00 -1.00 0.00
sx6 0.00 1.00 0.00 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution

z (min) -1.00 0.00 0.00
sx4 -50000.00 0.00 60000.00
x1 1.00 0.00 3.00
sx6 0.00 1.00 5.00

Phase 2 (Iter 3 No of No of
Basic x1 x2 Sx3 sx4
z (max) 0.00 0.00 250000.00 15.00
x2 0.00 1.00 2.50 0.00
x1 1.00 0.00 -1.00 0.00
sx6 0.00 0.00 -2.50 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution

z (max) blocked 0.00 2400000.00
x2 -2.50 0.00 3.00
x1 1.00 0.00 3.00
sx6 2.50 1.00 2.00

Thus, optimal solution calls for 3 programmes in TV and 3 programmes in Radio. This
would imply a total reach of 24,00,000, out of which Type A are 15,90,000 while Type B
are 8,10,000.
Using a Solver, custom made for this problem, we came up to an Optimized
Solution for the transportation Problem above as follows: