Mixed Integer Programming, Sos2, Piecewise Linear Modeling, Cplex, Gurobi.
search for an optimal solution when performing the branch-and-bound/branch-and-cut. Using a less user-friendly solver, we would have to re-encode all the constraints defining the SOS2. This approach requires a bit more work, but is feasible as long as the solver supports problems involving binary