A classical way to

compute all optimal solutions to an optimization problem

by re-parameterizing it as a constraint satisfaction problem:

1. find an optimal solution \(y^* = \max y\)
2. remove the objective function \(y\)
3. add the constraint \(y = y^*\)
4. instruct the solver to print all solutions.