It's not clear if you have an LP or MILP
In general, if the solution is non-unique in an LP, there are infinitely many solutions, hence you cannot get them all.
There is no support for extracting several solutions. What you will have to do is to come up with some iterative scheme where you solve it once to get the optimal value, then solve it again with the constraint objective == optimalobjective but a random objective, which typically will give you some other vertex, and then run that until you have many solutions, and hope that you have them all
If it is a binary problem, you can resolve with an exclusion constraint (command exclude) to generate all binary solutions in an iterative scheme