CVXPY
Maximize
  Sum(X, None, False)
Subject To
 26: max(X, None, False) + max(Y, None, False) <= 1.0
 31: Y == 1.0
Bounds
 X free
 Y free
End
----------------------------------------
AFTER COMPILATION
Minimize
  - C0 - C1
Subject To
 R0: C3 = 1
 R1: C4 = 1
 R2: C0 - C2 <= 0
 R3: C1 - C2 <= 0
 R4: C3 - C5 <= 0
 R5: C4 - C5 <= 0
 R6: C2 + C5 <= 1
Bounds
 C0 free
 C1 free
 C2 free
 C3 free
 C4 free
 C5 free
End
----------------------------------------
GUROBI
Maximize
  X[0] + X[1]
Subject To
 26: max_1 + max_2 <= 1
 31[0]: Y[0] = 1
 31[1]: Y[1] = 1
Bounds
 X[0] free
 X[1] free
 max_1 free
 Y[0] free
 Y[1] free
 max_2 free
General Constraints
 GC0: max_1 = MAX ( X[0] , X[1] )
 GC1: max_2 = MAX ( Y[0] , Y[1] )
End