nag_opt_qpconvex2_sparse_solve (e04nqc) Example Program Results QP problem contains 7 variables and 8 linear constraints Final objective value = -1.848e+06 Optimal X = 0.00 349.40 648.85 172.85 407.52 271.36 150.02