CVXPY
Maximize
  Sum(X, None, False)
Subject To
 55: maximum(X, z, 1.0) <= 2.0
 59: z == 1.0
Bounds
 X free
 z free
End
----------------------------------------
AFTER COMPILATION
Minimize
  - C0 - C1
Subject To
 R0: C4 = 1
 R1: C0 - C2 <= 0
 R2: C1 - C3 <= 0
 R3: - C2 + C4 <= 0
 R4: - C3 + C4 <= 0
 R5: - C2 <= -1
 R6: - C3 <= -1
 R7: C2 <= 2
 R8: C3 <= 2
Bounds
 C0 free
 C1 free
 C2 free
 C3 free
 C4 free
End
----------------------------------------
GUROBI
Maximize
  X[0] + X[1]
Subject To
 55[0]: maximum_1 <= 2
 55[1]: maximum_2 <= 2
 59: z = 1
Bounds
 X[0] free
 X[1] free
 z free
 maximum_1 free
 maximum_2 free
General Constraints
 GC0: maximum_1 = MAX ( X[0] , z , 1 )
 GC1: maximum_2 = MAX ( X[1] , z , 1 )
End