In: Statistics and Probability
Solve the following linear program using both the graphical and the simplex methods:
Max |
2X1 |
+ 8 X2 |
||
s.t. |
||||
3X1 |
+ 9X2 |
<= |
15 |
|
2X1 |
+ X2 |
>= |
12 |
|
X1, X2 |
>= |
0 |
Show graphically how the simplex method moves from one basic feasible solution to another. Find the coordinates of all extreme points of the feasible region.
From the graphic I can see there's no solution , but how to prove it through simplex method? Thank you!