GAMS World Forum

Hi,

Thanks for these useful links. Another question if the solver found the integer solution =26 at the node 180 for example, it will stop as the optcr will be equal to zero while the best bound will still decrease in the following nodes. Or this case won't occur ?

So if the best bound on the objective function value is known from the beginning of the problem what's the need for the iterations i.e. How does CPLEX solver have an estimate for it?

Thanks very much Mr. Fred.

Can you tell me what is meant by the best possible solution that CPLEX compares the feasible solution at each node with to calculate the absolute and relative optimality gap ?

1- I have an Integer Linear programming problem I solved it using CPLEX solver (mip) with optcr=0 does this provide a local optimal solution or global solution? If a use BARON (mip) instead will it be able to provide the global optimal solution as it is a deterministic global solver? DO I have to ad...

Dear Mr Michael, Can you help me by answering this question. I have a problem which has quadratic objective function and linear constraints. All variables are continuous. I used BARON solver with model type QCP. IS the solution obtained global optimal? Do I have to adjust any option in the solver? O...

HI,

I run a minlp model on baron solver but the results don't satisfy a constraint while the outpu message is normal compilation. how to set the constraint tolerance to zero?