PGDORM SEM II

ASSIGNMENT
Academic Year 2016-17

Please follow the instructions and submit the assignment in the given time.

1. Last date to submit these assignments is 13th October, 2017.

2. All assignments should be in written format. Assignment sheets to be collected from IDOL,
Room no 5.

3. No typed assignment or Xerox will be accepted.

4. Outstation students have to send the assignments by post, no assignment on mails to be

approved.

5. Outstation students can send on the address:

PGDFM/PGDORM Section, Room no 112, Institute of Distance and Open Learning, University
Of Mumbai, Kalina, Santacruz East, Mumbai- 400098.
 PGDORM Semester II
Assignment

Subject: Optimisation Models II Marks-20(5marks

each)

1) In a workshop the foreman finds that his previous day’s plan of assigning five different
jobs to five of his operators cannot be implemented, as one of the operators is absent. The
following matrix indicates the time taken in minutes by each of the operators present
today i.e. P, Q, R& S for doing the jobs 1 to 5. Using the Hungarian algorithm for
Assignment Problems, advice the foreman about optimal assignment of the jobs to
operators. Which job will remain un-allocated?

Operators → P Q R S
Jobs↓
1 2 5 4 2
2 3 8 2 1
3 10 1 3 5
4 9 3 5 4
5 10 11 13 9

2) A Transport Company provides daily bus service between Kolkata and Digha. It takes six
hours for a single one-way trip. The drivers and conductors can be provided with resting
facilities at either of the places i.e. Kolkata &Digha. The crew require a minimum of four
hours before undertaking the return trip. From the following timetable of bus services,
prepare an assignment schedule for routes assignment for minimising the waiting time.
Also indicate where the crew should be based for each pairing so obtained.

Route No. Departure Arrival Route No. Departure Arrival

Kolkata Digha Digha Kolkata
A1 0500 1100 B1 0400 1000
A2 0700 1300 B2 0500 1100
A3 0900 1500 B3 1000 1600
A4 1600 2200 B4 1300 1900
A5 1700 2300 B5 1500 2100

3) Indian Cricket Captain has to decide to select the batting order of batsmen based on their
past performance in terms of their average runs scored at various batting positions in first
class cricket in the past one year. The average runs recorded by the six batsmen A, B, C,
D, E and F differs depending on their position in the batting order. The following matrix
is available which indicates the historical average runs scored by these six batsmen for
 the first four batting positions. Assuming that their current form is in line with their
historical batting average, advise the captain about the choice of players for the first four
batting positions.

I II III IV
A 60 68 58 52
B 62 65 60 53
C 63 67 64 50
D 62 70 65 54
E 66 64 70 52
F 64 66 61 54

4) A construction firm in USA has supply centres located in Atlanta, Chicago, and New
York City. These centres have available 40, 20, and 30 units of a particular resource,
respectively. The firm's job sites have asked for the following number of units:
Cleveland, 25; Louisville, 10; Memphis, 20; Pittsburgh, 30; and Richmond, 15. The
shipping cost per unit in dollars between each centre and job site is given in the following
table

To To To To To
Cleveland Louisville Memphis Pittsburgh Richmond

From 55 30 40 50 40
Atlanta

From 35 30 100 45 60
Chicago

From New 40 60 95 35 30
York
Solve this as a Transportation Problem, by obtaining an Initial Feasible Solution (IFS)
using the Vogel’s Approximation Method (VAM). Check for optimality of the solution
and show how it could be improved by using MODI method. The objective is obviously
to minimise the total shipping cost.
 PGDORM Semester II
Assignment

Subject:Advanced Linear Programming Marks-20(5marks each)

1) Solve the following as Parametric Problem:

Maximize Z = (6 + 2t) X1 + (3 – t) X2
Subject to, 1. 6X1 + 3X2 ≤ 6
2. -3X1 + 4X2 ≤ 3, for X1, X2 and t ≥ 0

2) Two productsP1 and P2 are manufactured on two sequential machines M1 and M2.
The following table gives machine times, in hrs per unit of both the products.
The daily production quotes for P1 and P2 are 80 and 60 units respectively.
Each machine runs 16 hrs a day. Overtime, though, not desirable, may be used if
necessary to meet the production quota. Formulate the problem as Goal programming.

Machine time in hours

P1 P2
M1 5 3
M2 6 2

3) Explain the following term with illustrations

1) Gomory’s Cutting Plane Algorithm for Integer LPP
2) Dynamic Programming

4) Solve the given LPP by Simplex only. Find an Optimum Solution. Check if the same solution
can be called as Optimum Solution to IPP. If not iterate till you get Integral Values for the Basis.

Maximize Z = 100X1 + 85X2

Subject to
1) X1 + X2 ≤ 11 ……………(Resource 1)
2) 6X1 + 5X2 ≤ 60 …………(Resource 2)
X1, X2, ≥ 0
 PGDORM Semester II
Assignment

Subject: Basic Statistics II Marks-20(5marks each)

1)
Maths 89 92 67 48 43 76 79 98
Physics 78 94 56 59 74 72 63 83

The above table shows marks obtained by 8 students in two subjects, maths and physics.
Find Karl Pearson’s coefficient of correlation and also find spearman’s rank correlation.

2) What do you mean by 6-Sigma standards? Explain the importance.

3) Explain in detail- Scatter Diagram.

4) Production in Kg and profit in INR is given in the table [Production x and Profit y]

Production (kg) 148 152 136 142 159 164 167

Profit (INR 85 87 78 75 90 92 94
‘0000)

Using method of Least Squares, frame the:

a) Equation of regression line for x on y
b) Equation of regression line for y on x
c) Estimate the profit if production is 170 kg
d) To earn profit of INR 10,00,000/-, what quantity of production should be achieved?