OAI/Combinatorics/ContingencyTables/Transport/ResidualAugmentation.lean

GitHub source file

11 declarations, 0 contain sorry, 0 declared as axioms

Executed bottleneck and residual augmentation

The program takes the actual BFS path list, scans its residual capacities for a minimum, and adds the resulting skew path flow. No path or amount is chosen through a mathematical existence proof.

  1. def OAI.ContingencyTables.ResidualAugmentation.arcs line 21
  2. def OAI.ContingencyTables.ResidualAugmentation.bottleneck line 26
  3. def OAI.ContingencyTables.ResidualAugmentation.listUpdate line 29
  4. def OAI.ContingencyTables.ResidualAugmentation.step line 33
  5. lemma OAI.ContingencyTables.ResidualAugmentation.arcs_ofFn line 36
  6. lemma OAI.ContingencyTables.ResidualAugmentation.listUpdate_ofFn line 49
  7. lemma OAI.ContingencyTables.ResidualAugmentation.bottleneck_ofFn line 55
  8. lemma OAI.ContingencyTables.ResidualAugmentation.bottleneck_spec line 62
  9. theorem OAI.ContingencyTables.ResidualAugmentation.step_augmentation line 93
  10. theorem OAI.ContingencyTables.ResidualAugmentation.step_feasible line 104
  11. theorem OAI.ContingencyTables.ResidualAugmentation.step_none_maximum line 112