Example
IP2: Balas Additive Algorithm for Binary Integer Programming
We will be using the Balas
Additive Algorithm to solve the following problem:
Recall
that with the Balas Additive Algorithm, depth-first node
selection strategy is used.
Also, notice that the terms in the objective function are written in
increasing order, and that it is a minimization problem. So having x1 = 0 and x2 = 1 is worse than having x1 =1 and x2 = 0, etc.
Press the Start button twice to begin the example.