Linear Programming for DEA Assignment

Question 1
Linear programming for DEA (Sherman & Zhu, 2006) (Wang & Yang, 2007):
From the table below:
DMU A B C D E
INPUT X1 4 12 30 21 40
X2 8 6 5 6 24
OUTPUT Y 2 3 5 3 8
The following can be deducted:
LP for DMU-A
4 A +12 B+30 C+ 21 D+ 40E-4 s ≤08 A+6 B+5 C+ 6 D+ 24E-8 s ≤ 0 2 A +3 B+ 5C +3 D+8 E ≥2
LP for DMU-B
4 A +12 B+30 C+ 21 D+ 40E-12 s ≤ 08 A+6 B+5 C+ 6 D+ 24E-6 s ≤ 02 A +3 B+ 5C +3 D+8 E ≥3
LP for DMU-C
4 A +12 B+30 C+ 21 D+ 40E-30 s ≤ 08 A+6 B+5 C+ 6 D+ 24E-5 s ≤ 0 2 A +3 B+ 5C +3 D+8 E ≥5
LP for DMU-D
4 A +12 B+30 C+ 21 D+ 40E-21 s ≤ 08 A+6 B+5 C+ 6 D+ 24E-6 s ≤ 02 A +3 B+ 5C +3 D+8 E ≥3
LP for DMU-E
4 A +12 B+30 C+ 21 D+ 40E-40 s ≤ 0 8 A+6 B+5 C+ 6 D+ 24E-24 s ≤ 0 2 A +3 B+ 5C +3 D+8 E ≥8
Efficient levels of Inputs:
0.425 [12
6 ]+0.575 [40
24 ]=[ 28.1
16.35 ]
Efficient levels of Inputs
0.425 [ 3 ] +0.575 [ 8 ] =5.875

Efficient of port A: 0.625
Efficient of port B: =0.625
Question 2: (Smartnote, 2012) (Usmani, 2014)
Possible path and Critical path (highlighted is the critical path)
Start− A−B−E−Finish=10 daysStart− A−C−E−Finish=8 days
Start− A−D−Finish=10 days
Float time of all paths are: