Minimizing sum of Disrupted Passengers Objective: Minimize sum of Mimc∑nxp disrupted passengers pe P Flight coverage constraints ∑x+Zf tETf Aircraft balance for each sub ∑x+y=∑x+ fleet type (f,t血n(j (f, tEOut(j Xf+yf=res(a, ft, . Initial and end of the day aircraft resource constraints Passenger cancellation constraints +∑x2 Missed connected passengers gEC(u)d(gka(f) constraints p∈0l:xra∈0y20 Only flight copy variables, x, have to be binaryp p p P t f f t Tf tt tt ff ff (f ,t) In(j) (f,t) Out(j) f f p f t u f gp g C(u) d(g) a(f ) t t p f,a f Minimize n st : x z 1 xy xy x y Res(a,ft, ) z x x1 [0;1]; x {0,1}; y 0 ∈ ∈ − + ∈ ∈ • • ∈ <     ×ρ     + = += + += • ρ ≥ + −ρ ≤ ρ ∈ ∈≥ ∑ ∑ ∑ ∑ ∑ ∑ ¾ Objective: Minimize sum of disrupted passengers ¾ Flight coverage constraints ¾ Aircraft balance for each sub fleet type ¾ Initial and end of the day aircraft resource constraints ¾ Passenger cancellation constraints ¾ Missed connected passengers constraints ¾ Only flight copy variables, x, have to be binary Minimizing Sum of Disrupted Passengers