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
  - C0 - C1
Subject To
 R0: C4 = 2
 R1: C5 = 2
 R2: C0 - C2 <= 0
 R3: C1 - C3 <= 0
 R4: - C2 <= -2
 R5: - C3 <= 1
 R6: C2 - C4 <= 0
 R7: C3 - C5 <= 0
Bounds
 C0 free
 C1 free
 C2 free
 C3 free
 C4 free
 C5 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