Re: [Help-glpk] Transport Problem advanced

[SpaceRider]

But if I leave out the impossible combinations of supply & demand varcost =
"-1" I get always
following errormessage:
"no value for varcost[1,10]"

( x[i,j] is the solution quantity for combination )

This is my current reading process:

param supply{i in I};
...sql...
I <- [INo], supply ~ count;

param demand{j in J};
...sql...
 J <- [JNo], demand ~ min_count;

param varcost{i in I, j in J};
...sql...
[ INo, JNo ], varcost ~ cost;

Excuse me, I don't  know, what you mean - I'm a Beginner with glpk.

Or, is there a switch to ignore empty combinations?


Michael Hennebry wrote:
> 
> 
> A linear table with generic entry
> i, j, x[i,k]
> That is roughly how GLPK's API fills the constraint matrix.
> 
> 

-- 
View this message in context: 
http://www.nabble.com/Transport-Problem-advanced-tp19887773p23172934.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.