[Coin-lpsolver] Querying the feasible bounds

[Spencer Fung]

There is a typo, the feasible bound for X and Y should be [1,5] and [0,2]
respectively.

 

Spencer

 

  _____  

From: coin-lpsolver-bounces at list.coin-or.org
[mailto:coin-lpsolver-bounces at list.coin-or.org] On Behalf Of Spencer Fung
Sent: Saturday, November 05, 2005 1:45 AM
To: coin-lpsolver at list.coin-or.org
Subject: [Coin-lpsolver] Querying the feasible bounds

 

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/c00c89a4/attachment.html>