Please walk through all steps to solve.

Rusty Ryan, a project controller at Glade Computers, recently learned that it's possible to compress a project. The table below provides the details for a new project including tasks, precedence relations, marginal compression costs, and maximum compression limits. Rusty must develop a project schedule and would like to consider more than just the standard CPM schedule.

Because he has little experience with optimization, Rusty would like you to formulate and solve the mathematical program(s) required to answer the questions below.

Note: Round all answers to 3 decimal places. When entering compression strategies, remember to include values for starting and ending tasks and enter your answer as a vector (e.g. ).

TCTO Compression Strategy:

Minimum Makespan Schedule Cost:

TCTO Makespan:

Minimum Makespan Compression Strategy:

Minimum Makespan Schedule % Cost reduction (compared to CPM):

TCTO % Cost reduction:

TCTO Schedule Cost:

Minimum Makespan:

Task Predecessors Uncompressed Duration Compression Cost Maximum Compression start 0 0 0 A start 52 190 30 B start 47 120 14 B 45 130 17 D A.B 65 160 25 E CD 32 95 0 F A 46 180 19 G C.F 59 135 28 H A.C 36 100 0 I E.H 28 115 15 J D.G 54 140 0 K J 66 0 L I 74 90 0 M I 48 80 24 N E.K 72 19 end L.M.N 0 0 0 155 195