Mathematical Optimization aka. Mathematical Programming or Operations Research. The first phase is a dual simplex method whereas the second is the primal simplex with
the smallest coefficient pivot rule.
Select an instance form the navbar and you will obtain a detailed solution
Now you can see a complete solution with all steps visualised, that is all. The pivot row and pivot column
are marked in each iteration with blue color
Scroll to the end to see the graphical representation of the solution if you are eager to see the mechanics of the problem
Only nonnegative variables and maximization problems are supported at the moment.
I give you no warranty, this piece of software is provided as it is. Use it at your own risk. This is a Beta version. Sometime in the future I am
going to provide a complete explanation to each iteration of the algorithm.
As for now, you need some background knowledge. So consult any textbook or wikipedia or ask your teacher to understand the steps.
If your are a teacher, you are very welcome to use this page in your classes.
Please post you comments and suggestions
here . See also Disclaimer (in German)