[Clp] Problem formulation of CLP

[Yu, Haining]

Hi,

Thank you very much for making this tool freely available.

I could not find answers for the following questions in the CLP
documentation, so I post them here: 

1. Does CLP SIMPLEX use standard LP formulation or general form LP
formulation with upper/lower bounds? 

CLP allows users to specify upper/lower bounds on both variables and
constraints. This naturally leads to a general LP formulation. Does CLP
then convert the general form into a standard form LP (i.e., min c'x
s.t. Ax=b, x>=0) and solve, or CLP just solves a general LP with
bounded-variable SIMPLEX with explicit consideration of bounds? 

2. Beside source code, is the implementation detail of the SIMPLEX
method publicly available through documentation?

3. CLP provides status array for every variable (column) as well as
constraint(row). If a constraint is tagged basic, is it either at lower
bound or at upper bound?

Thanks,
Haining Yu

*********************************************************
*       Haining Yu
*       Sr. Operations Research Analyst
*       The Walt Disney Company
*       -----------------------------------
******  1375 Buena Vista Drive
******  Lake Buena Vista, FL 32830
*       -----------------------------------
******  PHONE: (407) 828-4821
******  FAX:   (407) 828-1315
*       -----------------------------------
******  E-MAIL: Haining.Yu at disney.com
*********************************************************

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20090127/253c45b7/attachment.html>