Originally posted by: geffer

For a specific problem and the same data, in order to accelerate operation time, add some elimination constraint. I have certain questions.

1 Whether best bound and best integer in mip solve information correspond to lower bound and upper bound in c++ optimization?
2 Even I add more constraint in modeling, the best bound still start at 0.0000,there is no different if I add more constraint, I want emphasize the new constraint advantage, whether cplex offer some information to appreciate different modeling?

thx
Corky
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: geffer

anyone could give some advice?
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: geffer

no one could explain?
thx
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

> geffer wrote:
> For a specific problem and the same data, in order to accelerate operation time, add some elimination constraint. I have certain questions.
>
> 1 Whether best bound and best integer in mip solve information correspond to lower bound and upper bound in c++ optimization?

Yes if you are maximizing, no if you are minimizing.

> 2 Even I add more constraint in modeling, the best bound still start at 0.0000,there is no different if I add more constraint, I want emphasize the new constraint advantage, whether cplex offer some information to appreciate different modeling?
>

Additional constraints do not automatically toughen bounds. Even if they cut off the optimal node solution, there is still the possibility t fast the node LP had multiple optima, and one of the alternate optima satisfies the new constraint.

Paul

Mathematicians are like Frenchmen: whenever you say something to them, they translate it into their own language, and at once it is something entirely different. (Goethe)
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: geffer

thanks for your reply
1 Whether best bound and best integer in mip solve information correspond to lower bound and upper bound in c++ optimization?

Yes if you are maximizing, no if you are minimizing.

If I want to minimize, what is the meaning of best bound and best integer? Or how could I find lower bound and upper bound in that case?

Keji
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

> geffer wrote:
> 1 Whether best bound and best integer in mip solve information correspond to lower bound and upper bound in c++ optimization?
>
> Yes if you are maximizing, no if you are minimizing.
>
> If I want to minimize, what is the meaning of best bound and best integer? Or how could I find lower bound and upper bound in that case?

Upper and lower bound, respectively.

Paul

Mathematicians are like Frenchmen: whenever you say something to them, they translate it into their own language, and at once it is something entirely different. (Goethe)
#CPLEXOptimizers
#DecisionOptimization