Make the names more understandable

[gnawin]

Here are some (minor) suggestions that will improve the readability of the code while going through the repo.

https://github.com/TulipaEnergy/NearOptimalAlternatives.jl/blob/main/src/alternative-optimisation.jl:

• l 23-25: maybe call them _initialobjective* (or original*)
• l 34: solution -> _initialsolution
• l 40: quite confusing to call a constraint _originalobjective, so _originalobjective -> _optimality_gapconstraint
• l 68: better to explain a bit more, e.g., by adding something like so the sum of the distance between the new solution and each of the previous solutions is maximized to the comment
• l 69: solution -> _previoussolution

https://github.com/TulipaEnergy/NearOptimalAlternatives.jl/blob/main/src/results.jl:

• l 31: shouldn't it be push!(results.objective_values, objective_value(model))? What do we want to store here?

https://github.com/TulipaEnergy/NearOptimalAlternatives.jl/blob/2-mga-metaheuristics/src/generate-alternatives.jl:

• l108: more explicit name?

[gnawin]

@marnoldus @greg-neustroev as mentioned here (https://github.com/TulipaEnergy/NearOptimalAlternatives.jl/pull/13#issuecomment-2150166607) here are some extras for the existing code. Most of them are just naming suggestions, but maybe the question (for l31 in results.jl) is worth a comment from you? Thanks!

[marnoldus]

@gnawin what I intend to store in the results are the solutions themselves and their objective value to the original problem. The optimality gap constraint (original objective) will be something like: $c^T x \geq (1 - \gamma)c^T x^*$. I believe the value function will return the left-hand side of the constraint, so the objective value to the old problem but for the new solution. I agree that this is not completely clear from this piece of code, so a bit more documentation on this can be useful. Let me know if you have any questions!