[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-glpk] How to solve a simple MIP problem?

From: Fernando H. Pratti
Subject: [Help-glpk] How to solve a simple MIP problem?
Date: Mon, 11 Aug 2003 16:25:03 -0300

Hi all,
I want to solve a simple problem MIP (I guess) using GLPK API, but I couldn't find some samples to help me.
My problem is:
    Minimize: x0
    x0 -p + b >= 0
    x0 -p -f >= -1
    b = 1
    f = 1
x0, b, f and p are all binary variables.
I've tried to change te code that cames with manual but didn't work...
More I change, more problems show up.
Someone could send me a simple C code that solve it?
Thanks in advance,
Fernando H. Pratti

reply via email to

[Prev in Thread] Current Thread [Next in Thread]