[Coin-lpsolver] Querying the feasible bounds

[Spencer Fung]

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?

 

Thanks.

 

Cheers

Spencer

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20051105/757ff6d4/attachment.html>