Академический Документы
Профессиональный Документы
Культура Документы
OF MAXCITY CLINIC
Submitted By:
Group 2, Section- A
Ankit Thareja 29NMP
Arun Saraswat 29NMP15
Gaurav Arora29NMP28
Khagesh Vasisth29NMP37
Mayank Kashyap29NMP40
Pritam Kumari29NMP42
Mohnish Singh29NMP46
Linear Programming
Assuming:
F = full-time doctors
P1 = part-time doctors starting at 9 (leaving at 1PM)
P2 = part-time doctors starting at 10 (leaving at 2 PM)
P3 = part-time doctors starting at 11 (leaving at 3 PM)
P4 = part-time doctors starting at noon (leaving at 4 PM)
P5 = part-time doctors starting at 1 (leaving at 5 PM)
Objective function:
Subject to constraints :
F + P1
10
F + P1 + P2 12
1/2F + P1 + P2 + P3 14
1/2F + P1 + P2 + P3 + P4 16
F + P2 + P3 + P4 + P5 18
F + P3 + P4 + P5 17
F + P4 + P5 15
F + P5 10
F 12
Part-time doctors cannot exceed 50% of total hours required each day,
which is the sum of the doctors needed each hour.
TORA ANALYSIS :
Solving the problem using the TORA software as it has many variables
and constraints
Results
The solution for minimization of cost we got is :
F = full-time doctors
P1 = part-time doctors starting at 9 (leaving at 1PM)
P2 = part-time doctors starting at 10 (leaving at 2 PM)
P3 = part-time doctors starting at 11 (leaving at 3 PM)
P4 = part-time doctors starting at noon (leaving at 4 PM)
P5 = part-time doctors starting at 1 (leaving at 5 PM)
=
=
=
=
=
=
10
6
1
2
5
0