a) Is this a convex problem? b) Find the optimal position (x*,y*), and the optimal value p* c) How large a duality gap would you expect? d) Write the dual problem and solve it: Find the dual optimal vector 2*, and the dual optimal value d*. e) How large is the duality gap you found? Task 7 Linear Programming Consider the following problem: 3x + 4y min subj. to x + 3y > 4 x + y 25 2x + y 23 where x,y R, are the optimization variables. In order to answer, you might have to a) click (yeso) b) enter the resulting x*, y*,p*, d* Sketch the situation - usually that helps! But do solve analytically. - Take your time, it's a good excercise to experience the structure. Mind, with our theoretical background (KKT) you can be more or less efficint, here