On Oct 19, 8:06 am, Saber Jalilzadeh-Galaeh <
sbr_612...@...>
wrote:
> Hi all,
> I am using AMPL/CPLEX and working on a MIP problem.
> When the problem is solved, I have this message:
>
> CPLEX 10.1.1: optimal integer solution; objective 198
> 4558 MIP simplex iterations
> 0 branch-and-bound nodes
>
> But I want to solve my problem using B & B while it did not.
> Somebody know why?
No branching was required. CPLEX applied some cuts at the root node
and got an integer-feasible solution, which is optimal. Or perhaps no
cuts were required -- if the LP relaxation gave an integer-feasible
solution, you would be done.
/Paul
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "AMPL Modeling Language" group.
To post to this group, send email to
ampl@...
To unsubscribe from this group, send email to
ampl+unsubscribe@...
For more options, visit this group at
http://groups.google.com/group/ampl?hl=en-~----------~----~----~----~------~----~------~--~---