I know how to find a solution that satisfies the constraints, but in my case I need to find a solution which does not satisfy the constraints. Is there anyway that lp_solve can do that for me?

Lets say I have the following in LP format:

max: a;
1 < a;
a < 10;

Then, I can use lp_solve to give me a solution satisfied by the constraints, but is it also possible to find a solution not satisfied by the constraints using lp_solve?