1. (5 points) Explain how the following optimization problem can be solved using linear programming. Here the variables are x1, ..., In, and furthermore Qij for i = 1, ..., m and j=1, ,...,n are given constants. max X1+2x2+3x3+...+nxn 31+...+un X1 +...+ In s.t. =1 aiji >0 20 Vi = 1,...,m 20 Vi = 1,...,n Xi ...) Hint: Note that if x1, Xn is a feasible solution to this optimization problem, then so is \x1, ..., len for any 1 > 0. Moreover these solutions all have the same cost