I'm using GUROBI to solve Quadratic Programming (QP) models. I'd like to understand which are the difference between the 3 algorithms available for the QP. Where I can study the barrier methods, the primal simplex and dual simplex? Is there any documentation about these methods? Where I can study the theory?
The implementation is very easy also because I have a lot of examples available. But I didn't find any theory documentation. Is there a section for theory documentation?
I studied the simplex method for linear programming (LP) but I don't know how the simplex method can also work for QP. Instead, I never studied the barrier method, only the Lagrangian method. I think is similar.
Please sign in to leave a comment.