Package dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.problem
-
Class Summary Class Description QPProblem Quadratic Programming is the problem of optimizing (minimizing) a quadratic function of several variables subject to linear constraints on these variables.QPProblemOnlyEqualityConstraints A quadratic programming problem with only equality constraints can be converted into a equivalent quadratic programming problem without constraints, hence a mere quadratic function.