[Help-glpk] Selection rules on degenerate solutions

[Panajotis Papazoglou]

Hello, 

I am a newbie on GLPK and Linear Programming having the following questions: 

Given is a LP or MILP problem with a degenerate optimum, that is at least two 
solutions exist with the same optimal value and I call them BLUE and RED. Lets 
assume that I know the two solutions.

According to which rules does GLPK select one of them? Is there a way I can 
deduce from the equation, constraints and the starting point of the search why 
GLPK found BLUE and not RED? 

Alternatively: How can I tell GLPK to choose BLUE in any case a degenerate 
solution exists and not RED? How could I insert some ordering or naming rules 
which do not have an effect on the optimal solution but which help to make the 
solution unambiguous?

Best regards, 
Pano
____________________________________________________
Aufnehmen, abschicken, nah sein - So einfach ist 
WEB.DE Video-Mail: http://freemail.web.de/?mc=021200