Special Cases in LPP

Assignment Problem
Transportation problem
Network & Distribution Models
 Example 1
Suppose TSM students have an option to earn by doing some
jobs in the campus and the assignments are mowing the
lawn, painting the wall, watering the plants and collecting
the plastics in the campus. For these jobs they can bid as
per as what they feel about a fair pay to avoid anticipated
competitions. The Dean asks 4 randomly chosen students
to submit their individual secret bid and the details are
given below. How the Dean should assign the works?
Work → Mow Paint Water Plastic
Student ↓ collection
Student 1 5 9 3 6
Student 2 8 7 8 2
Student 3 6 10 12 7
Student 4 3 10 8 6
Note: all the costs are in INR per every 30 minutes
 Example 2
Man → 1 2 3 4
Job ↓
I 12 30 21 15
II 18 33 9 31
III 44 25 24 21
IV 23 30 28 14

Find Optimal Assignment.

 Example 3
Job → I II III IV
Man ↓
A 2 3 4 5
B 4 5 6 7
C 7 8 9 8
D 3 5 8 4

Find Optimal Assignment.

 Hungarian Algorithm
• Step 1: Subtract the smallest entry in each row from all the
entries of its row.
• Step 2: Subtract the smallest entry in each column from all the
entries of its column.
• Step 3a: Starting with row 1 of the reduced cost matrix (from
Step 2), examine rows successively until a row with exactly 1
zero element is found and mark (box) it as an assignment has
been done here. Mark (X) at all other zeros in the
corresponding columns. Proceed this until the last row is being
examined.
• Step 3b:Continue steps 1 and 2 until the following situation
reached,
– I. All zeros are marked or crossed
– II. The remaining unmarked zeros lies at least two in each
row.
Hungarian Algorithm (Contd…)
When there is no optimal assignment in first cost reduction matrix –then
follow Step 4
STEP 4
I. Tick an UNASSIGNED ROW.
II. If a ticked row has a ZERO, then tick the corresponding column.
III. If a ticked column has an assignment, tick the corresponding row.
IV. Repeat step (ii) and (iii) till no more ticking is possible.
V. Draw lines through UNTICKED rows and through TICKED columns to
cover all zeros.
STEP 5: Select the smallest of the elements that do not have a line through
them, SUBTRACT it from all the element that do not have a line through
them, ADD it to every element that lies at the intersection of two lines and
LEAVE the remaining elements of the matrix unchanged.

STEP 6: At the end of the STEP 5 , number of zeros are increased (never
decreases) in the matrix than that of STEP 3. Now repeat the STEP 3 to the
modified matrix obtained in STEP 5, to get improved allocation matrix .
 Example 1
Jobs ↓ P1 P2 P3 P4 P5 P6
Persons
→
A 9 22 58 11 19 27
B 43 78 72 50 63 48
C 41 28 91 37 45 33
D 74 42 27 49 39 32
E 36 11 57 22 25 18
F 3 56 53 31 17 28
 Example 2
Man → I II III IV V
Job ↓

A 11 7 10 17 10
B 13 21 7 11 13
C 13 13 15 13 14
D 18 10 13 16 14
E 12 8 16 19 10
An air line that operates seven days in a week has time table
shown below. Crews must have a minimum layover time 5
hours between the flights. Obtain the pair of flights that
minimizes layover time away from home. Also for each pair
mention the town where the crew should be based.

Delhi- Jaipur Jaipur- Delhi

Flight No Depart Arrive Flight No Depart Arrive

101 6.00 AM 8.00 AM 201 8.00 AM 10.00 AM

102 8.00 AM 10.00 AM 202 9.00 AM 11.00 AM

103 2.00PM 4.00 PM 203 2.00 PM 4.00 PM

104 8.00 PM 10.00 PM 204 7.00 PM 9.00 PM