Linear Programming Approach The optimization problem min d 4∈%,a L 1 <L aex(S小,a)xa≤d,i=1,2,…,n 0, a 0-1 variable denoting whether xl-a .sll a)-denote whether sill=a jaa fractional solution to the above LP 2021/1/29 182021/1/29 18 The optimization problem min d; a  xj,a = 1, j =1, 2 , … , L ; 1  j L a   (si [j], a) xj,a  d, i = 1, 2, … , n. • xj,a – 0 -1 variable denoting whether x[j] = a • (si [j], a) – denote whether si [j] = a • x'j,a – a fractional solution to the above LP Linear Programming Approach