content_image/294939.jpg content_image/294938.jpg content_image/294937.jpg
Example 3 Again, we continue with the previous example. Because n$_{1}$ = 3 , n$_{2}$ = 1 , n$_{3}$ = 1 , n$_{4}$ = 1 , and n$_{5}$ = 0 there are in total (3 × 2+1) × (1 × 2+1) × (1 × 2+1) × (1 × 2+1) × (0 × 2+1) = 189 different sets of the form E ( ℓ$_{1}$, ℓ$_{2}$, ℓ$_{3}$, ℓ$_{4}$, ℓ$_{5}$ ) . 

To illustrate, consider a particular case in which ℓ$_{1}$ = 1 , ℓ$_{2}$ = 2 , ℓ$_{3}$ = 2 , ℓ$_{4}$ = 2 , and ℓ$_{5}$ = 1 . 

<img src='content_image/294939.jpg'>

<img src='content_image/294938.jpg'>

Suppose that we replace the usual constraint N ∑ i =1 ξ$_{i}$ = 1 , ξ ≥ 0 with a more restrictive one (20) in the main optimization problem. Then, the optimization should take the form of (21). 

<img src='content_image/294937.jpg'>

As long as constraint (E) holds, constraint (F) can be replaced with those in the last column of 

