MODEL PARKING OBJECTIVE Z
TYPE MIP DIRECTION MAXIMIZE
SOLVER LAMPS FROM LINE 49
**** SOLVER STATUS 1 NORMAL COMPLETION
**** MODEL STATUS 1 OPTIMAL
**** OBJECTIVE VALUE 34.0000
RESOURCE USAGE, LIMIT 1.550 1000.000
ITERATION COUNT, LIMIT 35 1000
** Solution Summary ** Primal Integer
Number of iterations 34 1
CPU Time (secs) 0.96 0.56
Number of nodes 0
Objective value 34.0000 34.0000
Exit - Optimal solution found
---- 50 VARIABLE X.L 1 if space is a parking spot 0 otherwise
1 2
3 1.000 1.000
4 1.000 1.000
5 1.000 1.000
6 1.000 1.000
7 1.000 1.000
8 1.000 1.000
9 1.000 1.000
10 1.000 1.000
11 1.000
12 1.000
13 1.000 1.000
14 1.000 1.000
15 1.000 1.000
16 1.000 1.000
17 1.000 1.000
18 1.000 1.000
19 1.000 1.000
20 1.000 1.000