sci.op-research

Simplex algorithm works for floating-point numbers (=broken numbers like 2/3
or 0.66)

Branch and Bound uses the simplex algorithm to try and round down broken
numbers on tree nodes. Therefore branch and bound is a wacky integer solver
(=whole numbers like 1 or 2 or 3 or 4). For 0.66 it would try 0 and 1 and
see which one is best.

So branch and bound complements the simplex algorithm. It sort of extends it
a little bit.

It's not a very good algorithm though, it's best effort, there are no
garantuees that it will find optimal solutions... it can take very long.

Bye,
Skybuck.

"saneman" wrote in message
news:fqbapa$rs2$1@news.net.uni-c.dk...
> What is the difference between simplex and branch and bound? As I
> understand they can both be used to solve linear programs.