Let us apply Algorithm 11.59 to a simple example of the time-partition constraints. In what follows, assume that the vector ii is and vector i 2 is (i2 ,j2); technically, both these vectors are...

Let us apply Algorithm 11.59 to a simple example of the time-partition constraints. In what follows, assume that the vector ii is and vector i 2 is (i2 ,j2); technically, both these vectors are transposed. The condition ii






The other equalities and inequalities are




Finally, the time-partition inequality, with unknowns c\, d\, e\, c2 , d2 , and e 2 , is




a) Solve the time-partition constraints for case i — that is, where i\ <>

b) Repeat part (a) for the case ii, where i\ — i 2 and ji <>

Algorithm 11.59