[Coin-lpsolver] Querying the feasible bounds

[Matthew Saltzman]

On Sat, 5 Nov 2005, Spencer Fung wrote:

> Hi all,
>
> I have a question about querying the actual bounds in CLP.
>
> Consider the example,
>
> Maximize X
> Subject to,
> X+Y <=5
> X-Y >= 1
> Bounds
> 0<=X<=infinity
> 0<=Y<infinity
>
> The feasible bounds for variable X and Y is [1,5] and [0,5] respectively.
> How can I know the feasible bounds of each variable before solve the
> problem?

These are the kinds of things the presolver can tell you.

> Thanks.
>
> Cheers
>
> Spencer

-- 
 		Matthew Saltzman

Clemson University Math Sciences
mjs AT clemson DOT edu
http://www.math.clemson.edu/~mjs