# JuMP - Get basis for integer solution

**URL:** <https://discourse.julialang.org/t/jump-get-basis-for-integer-solution/12138>\
**Category:** Optimization (Mathematical)\
**Tags:** jump\
**Created:** [July 3, 2018, 4:48pm UTC](https://discourse.julialang.org/t/jump-get-basis-for-integer-solution/12138 "2018-07-03T16:48:49Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![mbesancon](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/mbesancon/32/6528_2.png) [@mbesancon](https://discourse.julialang.org/u/mbesancon)\
**Post date:** [July 3, 2018, 4:48pm UTC](https://discourse.julialang.org/t/jump-get-basis-for-integer-solution/12138/1 "2018-07-03T16:48:49Z")

</div>

I was wondering if there is a way to get the basis at a final node of a branch-and-bound procedure, so including the additional constraints from cuts and bounds.

My goal is to compute a cone pointing from the feasible vertex and towards the final polyhedron.