Finding a better solution than the current one

[XB G]

Dear Johan,

I'm working on a mixed integer (linear) problem, I have known a suboptimal solution x* to the original problem. What I care about is that if there exists better (feasible) solutions than x*.

Can YALMIP (or any MILP solver compatible with YALMIP) stop when a better solution is found? I'm not trying to find the global solution or a solution with smaller MIP Gap. 

Thanks,

XB

[Johan Löfberg]

Mpost solvers have specific options to set to have the process terminate when a sufficiently good feasible solution is found, or if the lower bound has been shown to be larger than some value. Solver specific notation of course

Simple hack otherwise is to just add a constraint objective <= knownobjective-at_least_this_much_better and then solve a feasibility problem

[XB G]

Thanks for the fast response! I will use the simple hack.