[Couenne-tickets] [Couenne] #30: How can I get all the solutions point of a IP?

[Couenne]

#30: How can I  get all the solutions point of a IP?
------------------------+----------------------
  Reporter:  jmjcobano  |      Owner:  pbelotti
      Type:  task       |     Status:  new
  Priority:  major      |  Milestone:
 Component:  Couenne    |    Version:
Resolution:             |   Keywords:
------------------------+----------------------

Comment (by pbelotti):

 Hello. If I understand correctly, you would like to get all feasible
 solutions of a non-convex MINLP. I am afraid that this is not possible as
 there are, in general, an uncountable infinity of such solutions. There
 are finite implicit descriptions of such sets, but they are quite hard to
 obtain in general. This is also true for a mixed integer linear problem,
 hence I assume you are looking to solve a pure integer programming problem
 with finite bounds on all variables. In that case, Couenne does not
 provide that capability. I believe there are a few MILP solvers that allow
 for that, but not Couenne.

 I hope this helps.

--
Ticket URL: <https://projects.coin-or.org/Couenne/ticket/30#comment:1>
Couenne <https://projects.coin-or.org/Couenne>
Couenne, a solver for non-convex MINLP