The asymmetric integer program reuses the same logic on a different feasible region. Its LP relaxation and integer optimum do not match. This lesson shows the method generalizing without changing the exact arithmetic.
highlighted = computed this step
LP is not IP
The LP relaxation is (6/5, 8/5) with z=22/5. Why: the relaxed point is a bound, not an integer solution.
zLP=22/5
Second integer certificate
The integer optimum is (0, 2) with z=4. Why: the same branching logic generalizes to a different IP.
zIP=4
Diagram note
The second tree is recomputed from the asymmetric IP, not copied from IP-B. Pixel positions are rounded for layout; every number shown is exact.