=E*7.7. Consider the following special type of shortest path problem (discussed in Section 6.4) where the nodes are in columns and the only paths considered always move forward one column at a time.

3 5

6

(Origin) (Destination)

3 2

3 6

4 C

O A

B D T

Customer 1 2 3 Start-up cost $3 million $2 million 0 Marginal net revenue $2 million $3 million $0.8 million Capacity used per plane 20% 40% 20%

Maximum order 3 planes 2 planes 5 planes