-------- Forwarded Message --------
From: Matteo Fischetti DEI <[email protected]>
Reply-to: [email protected]
To: Andrew Makhorin <[email protected]>
Subject: Re: [Help-glpk] Help: How to build MIP model
Date: Fri, 04 Jan 2013 15:43:34 +0100
Hi Andrew.
to easy writing a MIP model (in Cplex) using C, I wrote the trivial
functions below
www.dei.unipd.it/~fisch/easy_lp.c
I do not know if you have something similar in GLPK, other than MathProg
of course, that could help beginners to write models with 1-index
variables (for 2-index var.s similar functions can be written)
Take care
--Matteo--
Il 04/01/2013 15:01, lucacoopers ha scritto:
> First, thanks to all. Jeff you're right. I misspelled my problem. The problem
> is:
>
> minimize { sum[from i=1 to 96] of {c1*x1(i)+c2*x2+c3*x3(i)} }
> with this constraints:
> x1(i)+x2+x3(i)=c4(i)
> x1(i)+x3(i)=c5
> x1(i)>=5
> 0<=x3(i)<=100
> 0<=x2<=1 binary
>
> where x1, x3 and c4 are vectors of 96 elements. c1,c2,c3,c5 are
> numbers.
>
> Sorry for the mistake. I wish someone would write the problem in a form
> similar to that described above. I need to learn how to write a minimization
> problem with glpk with the language c.
>
> thanks again to all:-)
--
Prof. Matteo Fischetti
DEI, University of Padova
via Gradenigo 6/A
I-35131 Padova (Italy)
e-mail: [email protected]
web: www.dei.unipd.it/~fisch
reports: www.dei.unipd.it/~fisch/papers
_______________________________________________
Help-glpk mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/help-glpk
