- #1
lockedup
- 70
- 0
Homework Statement
I made this problem up as an example for a bigger problem I have to do. P = {(-2,4),(1,3)} and Q = {(-1,1),(0,0)}. I need to use linear programming to find the best line to go between them.
Homework Equations
Max d
subject to:
y[itex]_{i}[/itex]≥ax[itex]_{i}[/itex]+b+d (for all points above the line (P))
y[itex]_{i}[/itex]≤ax[itex]_{i}[/itex]+b-d (for all points below the line (Q))
The Attempt at a Solution
Max d
subject to:
4≥-2a+b+d
3≥ a+b+d
1≤ -a+b-d
0≤ b-d
I put this into Excel (the file is attached) and it's telling me that it is not feasible. I'm trying to do the Simplex Algorithm by hand but it is taking forever. I'm thinking that maybe I don't have it set up right in Excel. Any suggestions? Thanks in advance for any help you all can give!