# Simplicial decomposition equals dual cutting plane---a toy example

**URL:** <https://discourse.julialang.org/t/simplicial-decomposition-equals-dual-cutting-plane-a-toy-example/129128>\
**Category:** Optimization (Mathematical)\
**Tags:** examples, dantzig-wolfe\
**Created:** [May 19, 2025, 1:36am UTC](https://discourse.julialang.org/t/simplicial-decomposition-equals-dual-cutting-plane-a-toy-example/129128 "2025-05-19T01:36:31Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![odow](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/odow/32/28685_2.png) [@odow](https://discourse.julialang.org/u/odow)\
**Post date:** [May 19, 2025, 7:36pm UTC](https://discourse.julialang.org/t/simplicial-decomposition-equals-dual-cutting-plane-a-toy-example/129128/2 "2025-05-19T19:36:28Z")

</div>

> Note: if JuMP were smart enough, we could have equivalently  
> written the above line as ✅ JuMP.@constraint(m, π, V \* c == p)

Just a note that you can do this:

```julia
julia> @constraint(model, π, V * c == p)
π : [c[1] - p[1], c[2] - p[2], -p[3]] ∈ Zeros()

```

I’ll also gently link you back to this comment: [A code example on primal-dual algorithm for LP - #7 by gdalle](https://discourse.julialang.org/t/a-code-example-on-primal-dual-algorithm-for-lp/128148/7). This sort of teaching topic might be best as a blog post, rather than a thread on Discourse.

---

_[View the full topic](https://discourse.julialang.org/t/simplicial-decomposition-equals-dual-cutting-plane-a-toy-example/129128)._