dv = to assign crews to flight sequences to minimize cost

1 - if a sequence (j) is assigned to a crew

Xj =
0 - if not assigned
Minimize cost: Z = 2x1 + 3x2 + 4x3 + 6x4 + 5x6 + 7x7 + 8x8 + 9x9 = 9x10 + 8x11 + 9x12
S.t.:
SF to LA: x1 + x4 + x7 + x10 >= 1
SF to Denver: x2 + x5 + x8 + x11 >=1
SF to Seattle: x3 + x6 +x9 + x12 >= 1
LA to Chicago: x4 + x7 + x9 + x10 + x12 >= 1
LA to SF: x1 +x6 + x10 + x11 >= 1 All flights to be covered, thus,
Chicago to Denver: x4 + x5 + x9 >= 1 minimum 1 crew to be assigned
Chicago to Seattle: x7 + x8 + x10 + x11 + x12 >= 1 per route.
Denver to SF: x2 + x4 + x5 + x9 >= 1
Denver to Chicago: x5 + x8 + x11 >= 1
Seattle to SF: x3 + x7 + x8 + x12 >= 1
Seattle to LA x6 +x9+ x10+ x11+ x12 >= 1

Total crews = 3; Thus, xj = 3 for j = 1,2...,12 and xj binary (1,0) for j = 1,2, . ,12