I am wondering if you have a program, surely you are not contemplating doing this by hand.
http://people.hofstra.edu/stefan_waner/realworld/tutorialsf4/unit4_4.html
Use simplex method to solve
Maximize p = 30x + 20y+30z subject to
x + y+z <= 9
4x + 2y-2z <= 30
5x + 10y+3z <= 60
x, y, z >=0
3 answers
HI,
AM ACTUALLY CALCULATING THS BY HAND.
THANKS FOR THE TUTORIALS..
AM SURE THEY WILL ASSIST ME GREATLY..
AM ACTUALLY CALCULATING THS BY HAND.
THANKS FOR THE TUTORIALS..
AM SURE THEY WILL ASSIST ME GREATLY..
There is also this example that describes in detail the use of the simplex tableau (by hand) for multiple constraints and variables.
It looks complicated but you will find it mechanical once you have understood it (like everything else in maths).
http://math.uww.edu/~mcfarlat/s-prob.htm
It looks complicated but you will find it mechanical once you have understood it (like everything else in maths).
http://math.uww.edu/~mcfarlat/s-prob.htm