Integer Programming

Branch & Bound – LP relaxation, branching tree and tableau steps

Define Problem

CSV format (semicolon-separated):
max;5;4 # direction; objective coefficients
<=;6;4;24 # sign; coefficients; right-hand side
<=;1;2;6
# direction: max or min | sign: <=, >=, =