... 1) (3, 2)(3, 1) (1, 2)(5, 1) 233456222 1 1 1 1 1 1 1 1 1 1 1 (–, ∞)(2, 1) (1, 1) (5, 1) 242 1 1 1 11 12563(–, ∞)24563 1 Fig. 6.6 Example of maximal flow problem 17 8 Chapter ... value 0, +1, or 1. 6.8 Maximal Flow 17 1(a)(b)(c)(d)(e)(4, 1) (3, 1) 2 1 1 1 3 1 222354 1 6 (1, 2)(–, ∞)(2, 1) (2, 1) (1, 1) (4, 1) 223456 1 1 1 1 1 1 1 1322(–, ∞)(4, 1) (3, ... every x 1 , x2∈ and every ,0 1, there holdsfx 1 + 1 x2 fx 1 + 1 fx2If, for every ,0<< ;1, and x 1 =x2, there holdsfx 1 + 1 x2 < fx 1 + 1 fx2then...