# Seeking help on Branch and Price

**URL:** <https://discourse.julialang.org/t/seeking-help-on-branch-and-price/112020>\
**Category:** Optimization (Mathematical)\
**Tags:** jump\
**Created:** [March 23, 2024, 3:22pm UTC](https://discourse.julialang.org/t/seeking-help-on-branch-and-price/112020 "2024-03-23T15:22:55Z")\
**Posts on this page:** 1\
**Showing post:** 3

<div class="post-metadata">

**Author:** ![WalterMadelim](https://avatars.discourse-cdn.com/v4/letter/w/3e96dc/32.png) [@WalterMadelim](https://discourse.julialang.org/u/WalterMadelim)\
**Post date:** [May 19, 2025, 1:39am UTC](https://discourse.julialang.org/t/seeking-help-on-branch-and-price/112020/3 "2025-05-19T01:39:32Z")

</div>

My opinion is: one might not have to stick at branch and price (or, a column generation algorithm).

There are 2 iterative procedures regarding large-scale LP/MIP:

1. iteratively adding cutting planes, aka outer approximation, constraint generation
2. iteratively recruiting vertices of the original polyhedron, aka inner approximation, column generation

They essentially have a dual relationship—meaning that you **only have to opt one of the two** methods. The outer approximation cutting plane method is more widespread and technologically mature (e.g. the Gurobi solver is a branch-and-cut solver), thereby more advisable.

[here](https://discourse.julialang.org/t/simplicial-decomposition-equals-dual-cutting-plane-a-toy-example/129128) is an example that might be illuminating.

---

_[View the full topic](https://discourse.julialang.org/t/seeking-help-on-branch-and-price/112020)._