In: Advanced Math
maximize z = 2x1+3x2
subject to x1+3X2 6
3x1+2x2 6
x1,x2
This can be simply done by drawing all the lines in the x-y plane and looking at the corner points.
Our points of interest are the corner points and we will check where we get the maximum value for our objective function by putting all the four corner points. (2,0), (0,2), (0,0), (6/7, 12/7)
We get maximum at = (6/7, 12/7) and the maximum value is = 6.8571
1.Implement simplex algorithm.
2.What is the sequence of extreme points in the simplex algorithm?