Example: confidence
Solving Integer Programming with Branch-and-Bound …

Solving Integer Programming with Branch-and-Bound …

Back to document page

1. The relaxation of the subproblem has an optimal solution with z<z∗where z∗is the current best solution; 2. The relaxation of the subproblem has no feasible solution; 3. The relaxation of the subproblem has an optimal solution that has all integer values (or all binary if it is an BIP). 8

  Relaxation

Download Solving Integer Programming with Branch-and-Bound …


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries