Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



traversing the vertices of a simplex
Posted:
Jul 16, 1996 2:55 PM


Hi everyone,
I am looking for an algorithm or better still, matlab code to enumerate all the vertices of the simplex defined as
S = { x : Ax = b; x >= 0 }.
A and b are such that S is nonempty and bounded. So no checks are needed for that.
Thanks a lot.  Ashu



