In Exercises 1-5 solve the linear programming problems. Maximize f = 2x + y subject to4x + y ::5 16x+y:5 7x O,y 0

l Grcx)\no $'ti . *rf"') -l[.o*\nC") l[,,' \n l'Cx-l* : +A) = IC) '\n\x\ {'Cg --'/v nK*l)'f{n *tt }'co)=r 3 Sci l'[-) =\t** 'i.^ FC; --\o\r,\rJ {' (r)r*n^ ffi; t{ *3y*56)l= -f-g'- i r-\ f{d,=-f,c1 re1 q'(1c)) lC3Ci) = 1'Cx) fot",l=. \-y,z FC"--) L5)\.___Fq- fo-=_ j"l"* \.[."D= \ntA b**d t n $) = [n L,) r^C$ {tn =fil $[x] 1G