Solving a maximization problem

Hello:

Is it possible to solve a maximization linear programming problem with OSQP? If so, does it mean to multiply -1 on the gradient vector? Thanks

You just change the sign of your objective function. In your case, just multiply the linear term in the cost by -1.