i'm trying to maximize the equation z=2x1+4x2+3x3 subject to
x1>=0,x2>=0, and x3>=0
where x1,x2,and x3 are the axis in the graph. i was able to maximize problems in R^2 easily by finding the extreme points, but i'm having difficulty finding extreme points of the polyhedron in R^3. is there any way to find such extreme points in R^3?
ahhh thats what i was figuring he used to solve this problem. unfortunately we have not covered the simplex algorithm yet in too much details. is there another way to do this problem? (for example in R^2 we just figure out the vertices and check the function value at those respective points) if not i guess i'll have to go read up on the simplex algorithm.
just a thought, but is it possible to see what happens when u set one of the three coordinates to zero (im thinking we will get 3 vertices), and set two of them equal to zero (you get 3 more vertices), etc. and just check those function values? because i'm thinking that if i can somehow find all the vertex points, computing the maximum will be like cake.
There are six constraints.
set current best=-10000 lets say
If you cycle through sets of three assumed active constaints (that is the equality condition applies), these if they are not degenerate they define a point. Check if this satisfies the remaining constraints, if it does it is a vertex of the feasible region. Comupute the objective, if this is bigger than current best set current best equal to it.
That should do it, it will check more points than the simplex algorithm but it will find an optimum vertex (the objective may be achived along an edge or face but as we ignore degenerate constraint sets we will end up at a vertex).
You will end up checking 120 sets of constraints this way, there may be a way to reduce that number without having to go to the full simplex algorithm