Igor,
> I need some help in writing MILP problems in GNU MathProg can you
> please help me with this. The problem is the following:
> min p #39; d
> s.t. c #39;? ? S
> A? ? (? + d) ? 0,
> A? + (? + d) ? 0,
> ?1 = 0,
> ?n = 1;
> ?i ? {0, 1} for i = 1, 2, . . . , n,
> di ? {0, 1} for i = 1, 2, . . . ,m,
> ?i ? [0, 1] for i = 1, 2, . . . ,m.
> where p is array with m elements, d is array with m elements
> (binary), A is mxn matrix, c is array with m elements, w is binary
> array with m elements,
> ? is binary array with n elements.
> Could you please help me with this, I really need this for my research.
Please re-send your message using a more suitable encoding. Some
characters are incorrectly displayed, so I am unable to read them.
Andrew Makhorin
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
