1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

How to solve this Linear Programming problem graphically

  1. Oct 21, 2012 #1
    1. The problem statement, all variables and given/known data

    Solve the following LP problem GRAPHICALLY

    Minimise -x1+x2
    subject to constraints x1+x2 >=1,
    x1+2x2<=8,
    x1-x2<=5,
    x1>=0, x2>=0.

    a)by sketching the feasible set
    b)finding optimal solutions of this LP problem. What is the optimal value of the objective function?
    c) If the objective is changed to 'maximise -x1_x2' then how does the optimal solution change?



    2. Relevant equations



    3. The attempt at a solution

    Do I just draw lines for all the equations, then choose 'corner points' and see if they satisfy each equation then shade the right area?
     
  2. jcsd
  3. Oct 21, 2012 #2

    mfb

    User Avatar
    2016 Award

    Staff: Mentor

    Draw lines, shade the excluded regions. The remaining area satisfies all inequalities, and you can check the corners.
     
  4. Oct 21, 2012 #3
    Thanks that's what I did!
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: How to solve this Linear Programming problem graphically
Loading...