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

Specific Domains Optimization (Mathematical)
,
2

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

Just a note that you can do this:

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. This sort of teaching topic might be best as a blog post, rather than a thread on Discourse.

3 Likes