[BCP] Maximization and positive reduced costs
George Tzallas-Regas
george.tzallas-regas at imperial.ac.uk
Tue Apr 20 11:38:54 EDT 2010
Dear all,
I am trying to use BCP for a maximization in a Vehicle Routing Problem.
The subproblem generates routes by appropriately maximizing an
objective function. I also use the virtual method
OsiSolverInterface::setObjSense (-1)
(for the appropriate object of course) in the virtual method of
BCP_lp_user::initialize_solver_interface ()
My columns, since it is a maximization problem have a positive
reduced cost. Although I have changed the master problem to
maximization, the columns I add in
BCP_lp_user::vars_to_cols (...)
are removed, since they have a positive reduced cost. One would
expect though, that for maximization they would be acceptable.
Is there something I can do for this, apart from the obvious (which
I have tried) change of adding a column, the objective of which is
the negative of the value of the column? I am just familiarising myself
with Bcp, so I am not confident doing so.
Regards
George
--
---------------------------------------------------------------------------
George TZALLAS-REGAS email: gt299 at imperial dot ac dot uk
QUADS Section room : 357, Huxley Building
Department of Computing tel : (0)20 759 4 8366
Imperial College London fax : (0)20 758 1 8024
180 Queen's Gate
London SW7 2AZ
---------------------------------------------------------------------------
More information about the BCP
mailing list