[Dip] generateCuts Question

[Matthew Galati]

>
>
>  Kipp - the example you sent finds the optimal solution after a few
>>
>
> How does it know the solution is optimal, if integrality does not imply
> optimality? See me example below.



Ahh... this is where the DecompApp::APPisUserFeasible function comes in.

By default, DIP assumes, that if problem is LP feasible to the linear system
and IP feasible, then it is feasible. In the case where the user knows
something that DIP does not (e.g., that the linear system does not define
the entire valid constraint system, as in TSP), then they must provide a
derivation of this function APPisUserFeasible. Then, DIP will check LP
feasible, IP feasible and lastly, APPisUserFeasible before declaring a point
a feasible solution.

See TSP for an example of its usage:

https://projects.coin-or.org/Dip/browser/trunk/Dip/examples/TSP/TSP_DecompApp.cpp
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/dip/attachments/20101008/28886484/attachment.html