Answer Happy

Question 5 You are given two optimization problems below. Since the constraints use absolute value function, the problems below are not linear programs. One of them can be rewritten as a linear program and the other one can be rewritten an as integer program. Make the correct decision and write the corresponding formulations 1. (10pt) max 1 + 2r2 st.+ral S3 -2511,7252 .. (10p) max +22 st. Ir+ral 23 -2571,9252 3. (15 pt) For this part, let ya, 32 and ys be binary variables. Let z be another binary variable such that z = (y and ya) or us Using additional binary mariables, write linear constraints that correctly model the relationship between and y. y. y