# Detailed simplex, branch and bound and transportation solvers for Julia
**URL:** https://discourse.julialang.org/t/detailed-simplex-branch-and-bound-and-transportation-solvers-for-julia/46538
**Category:** Optimization (Mathematical)
**Tags:** question, package
**Created:** [September 13, 2020, 7:54am UTC](https://discourse.julialang.org/t/detailed-simplex-branch-and-bound-and-transportation-solvers-for-julia/46538 "2020-09-13T07:54:06Z")
**Posts on this page:** 3
**Page:** 1
### Author:  [@fusion809](https://discourse.julialang.org/u/fusion809)
#### Post date: [September 13, 2020, 7:54am UTC](https://discourse.julialang.org/t/detailed-simplex-branch-and-bound-and-transportation-solvers-for-julia/46538/1 "2020-09-13T07:54:06Z")
I’m just wondering whether there are any Julia packages that show:
- detailed simplex tableaux for each iteration of the simplex method required to solve a linear programming problem;
- detailed information about the branch and bound iterations required to find the optimal solution to an integer programming problem; and
- detailed transportation tableaux for each iteration of the UV method as well as the initial feasible tableau generated using Vogel’s approximation method.
Naturally, I’m happy for answers that just mention a package that does one of these things and not all three. I know that JuMP is able to show the final solution to linear programming, integer programming and transportation problems, but I was wondering whether there’s a package that also shows the intermediate steps and completed tableaux, which are potentially useful for education purposes.
Thanks for your time.
---
### Author:  [@mtanneau](https://discourse.julialang.org/u/mtanneau)
#### Post date: [September 13, 2020, 7:15pm UTC](https://discourse.julialang.org/t/detailed-simplex-branch-and-bound-and-transportation-solvers-for-julia/46538/2 "2020-09-13T19:15:11Z")
As far as I know, not explicitly, no.
1. For simplex tableaux, you may take a look at the following Julia implementations of the simplex algorithm:
2. For branch-and-bound, aside for [Alpine.jl](https://github.com/lanl-ansi/Alpine.jl) and [Juniper.jl](https://github.com/lanl-ansi/Juniper.jl), I do not know of a Julia implementation of a general branch-and-bound scheme.
AFAIK, the above two links were not designed for educational purposes.
---
### Author:  [@SonLe](https://discourse.julialang.org/u/SonLe)
#### Post date: [October 23, 2020, 11:20am UTC](https://discourse.julialang.org/t/detailed-simplex-branch-and-bound-and-transportation-solvers-for-julia/46538/3 "2020-10-23T11:20:04Z")
In terms of Branch-and-bound, you should take a look at [Coluna.jl](https://github.com/atoptima/Coluna.jl).