[Couenne-tickets] [Couenne, a solver for non-convex MINLP problems] #17: segmentation fault in expression::compare with exprCopy

[Couenne, a solver for non-convex MINLP problems]

#17: segmentation fault in expression::compare with exprCopy
-------------------------+----------------------
  Reporter:  stefan      |      Owner:  somebody
      Type:  defect      |     Status:  new
  Priority:  major       |  Milestone:
 Component:  component1  |    Version:
Resolution:              |   Keywords:
-------------------------+----------------------

Comment (by pbelotti):

 These expressions were designed to be a little more flexible than just max
 {f1(x), f2(x),...}. They are defined with 2k arguments as follows:

 y = max {g_1(x), f_1(x), g_2(x), f_2(x), ..., g_k(x), f_k(x)}

 where x is the vector of variables. These expressions mean that, given x,
 if g_i(x) >= g_j(x) for all j!=i, then y=f_i(x). The maximum of a set of
 functions is then simply given by setting g_i(x) = f_i(x), as in the
 example provided.

 Observe that these expressions are not yet in the set of usable operators
 of Couenne, because at this point there is no generator of linear
 inequalities for them.

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