1. The problem statement, all variables and given/known data Minimize |2x1-3x2| subject to x1+x2≤5 -x1+x2≥-1 x1≥0, x2≥0 (a) Solve the problem graphically. (b) Formulate a linear program that could be used to solve the problem. Use software to solve your LP and show how to reconstruct a solution to the original problem. 2. Relevant equations 3. The attempt at a solution I started graphing the problem and posted an attachment of what I have. I usually solve these by way of the corner point method (just to check that my graphical method is correct), but once I found my corner points for this problem I found that 2 of them have the same value but are not adjacent CPF solutions (0,0)=0 (1,0)=1 (3,2)=0 (0,5)=15 This is what's confusing me... also, how would I show the graphical method when absolute value is involved? I started to try it, but I would like to know if I'm doing it correctly before going further.