# Solving QP and Conic Programs via Linear Cuts?

**URL:** https://discourse.julialang.org/t/solving-qp-and-conic-programs-via-linear-cuts/1526
**Category:** Optimization (Mathematical)
**Created:** [January 16, 2017, 7:13pm UTC](https://discourse.julialang.org/t/solving-qp-and-conic-programs-via-linear-cuts/1526 "2017-01-16T19:13:38Z")
**Posts on this page:** 3
**Page:** 1

<div class="post-metadata">

### Author: ![ccoffrin](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/ccoffrin/32/400_2.png) [@ccoffrin](https://discourse.julialang.org/u/ccoffrin)
#### Post date: [January 16, 2017, 7:13pm UTC](https://discourse.julialang.org/t/solving-qp-and-conic-programs-via-linear-cuts/1526/1 "2017-01-16T19:13:38Z")

</div>

In JuMP, is there a solver that takes in a convex model and an LP solver and solves the model by a sequence of linear cuts?

---

<div class="post-metadata">

### Author: ![miles.lubin](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/miles.lubin/32/279_2.png) [@miles.lubin](https://discourse.julialang.org/u/miles.lubin)
#### Post date: [January 16, 2017, 7:17pm UTC](https://discourse.julialang.org/t/solving-qp-and-conic-programs-via-linear-cuts/1526/2 "2017-01-16T19:17:54Z")

</div>

Not that I’m aware of, wouldn’t be hard to code one up though.

---

<div class="post-metadata">

### Author: ![ccoffrin](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/ccoffrin/32/400_2.png) [@ccoffrin](https://discourse.julialang.org/u/ccoffrin)
#### Post date: [January 16, 2017, 7:41pm UTC](https://discourse.julialang.org/t/solving-qp-and-conic-programs-via-linear-cuts/1526/3 "2017-01-16T19:41:41Z")

</div>

That’s what I am thinking. 🙂