CVXPY
Maximize
  Sum(X, None, False)
Subject To
 35: maximum(X, [ 2. -1.]) <= Y
 40: Y == 2.0
Bounds
 X free
 Y free
End
----------------------------------------
AFTER COMPILATION
Minimize
  - x_0 - x_1
Subject To
 R0: x_4 = 2
 R1: x_5 = 2
 R2: x_0 - x_2 <= 0
 R3: x_1 - x_3 <= 0
 R4: - x_2 <= -2
 R5: - x_3 <= 1
 R6: x_2 - x_4 <= 0
 R7: x_3 - x_5 <= 0
Bounds
 x_0 free
 x_1 free
 x_2 >= 2
 x_3 >= -1
 x_4 free
 x_5 free
End
----------------------------------------
GUROBI
Maximize
  X[0] + X[1]
Subject To
 35[0]: maximum_1 - Y[0] <= 0
 35[1]: maximum_2 - Y[1] <= 0
 40[0]: Y[0] = 2
 40[1]: Y[1] = 2
Bounds
 X[0] free
 X[1] free
 maximum_1 free
 maximum_2 free
 Y[0] free
 Y[1] free
General Constraints
 GC0: maximum_1 = MAX ( X[0] , 2 )
 GC1: maximum_2 = MAX ( X[1] , -1 )
End