[Help-glpk] how to describe large matrix in octave to call GLPK

[Jack Franklin]

HI,

I am doing research in the parallel computing and I need to do programming
in MPITB\octave in
order to implement some algorithm to solve mixed linear programming.

I need to call GLPK package from octave.

But, I do not know how to describe the linear programming problem components
for GLPK .

For example, how to describe AX + BY - CZ <=b, and  (AX ? BY + CZ) >=  (EX
? FY + DZ) in octave
so that I can call GLPK to solve them ?.

here , X,Y,Z are n-dimension decision variables and  A,B,C, D,E,F are 
coefficient matrices.

I have got some simple examples about GLPK programming but they are very
simple and the matrices are
input by hand.

My LP problem is very large and how can I describe them in octave more
efficiently?


Thanks,


Jack

Nov. 21 2008 
-- 
View this message in context: 
http://www.nabble.com/how-to-describe-large-matrix-in-octave-to-call-GLPK-tp20633515p20633515.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.