On Thu, 11 Jun 2009, Joey Rios wrote:
My variables are often part of a convex combination, so the sum of some subset of them needs to be 1. It seems odd that one of them from this subset would be basic with a value of zero and another is non-basic with a value of 1. I'm trying to understand what algorithmic paths might be taken to get to such a solution.
It means that only one item has a non-zero weight, therefore that weight is one. It would be interesting to see what happened if you eliminated the explicit upper bounds on your weights. They should be implied by the other constraints. -- Michael [email protected] "Pessimist: The glass is half empty. Optimist: The glass is half full. Engineer: The glass is twice as big as it needs to be." _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
