lemon/lp_cplex.h
author deba
Tue, 31 Jan 2006 20:04:36 +0000
changeset 1933 a876a3d6a4c7
parent 1875 98698b69a902
child 1956 a055123339d5
permissions -rw-r--r--
Revising the bpugraph concept

We need a public but very limited ANode and BNode class
It can be used with ItemSetTraits and with some special maps

By example:
DescriptorMap<Graph, ANode>
InvertableMap<Graph, ANode, string>
IterableBoolMap<Graph, ANode>
IterableIntMap<Graph, ANode>
IterableValueMap<Graph, ANode, string>
     1 /* -*- C++ -*-
     2  * lemon/lp_cplex.h - Part of LEMON, a generic C++ optimization library
     3  *
     4  * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     5  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     6  *
     7  * Permission to use, modify and distribute this software is granted
     8  * provided that this copyright notice appears in all copies. For
     9  * precise terms see the accompanying LICENSE file.
    10  *
    11  * This software is provided "AS IS" with no warranty of any kind,
    12  * express or implied, and with no claim as to its suitability for any
    13  * purpose.
    14  *
    15  */
    16 
    17 #ifndef LEMON_LP_CPLEX_H
    18 #define LEMON_LP_CPLEX_H
    19 
    20 ///\file
    21 ///\brief Header of the LEMON-CPLEX lp solver interface.
    22 
    23 #include <lemon/lp_base.h>
    24 
    25 extern "C" {
    26 #include <ilcplex/cplex.h>
    27 }
    28 
    29 namespace lemon {
    30 
    31 
    32   /// \brief Interface for the CPLEX solver
    33   /// 
    34   /// This class implements an interface for the CPLEX LP solver.
    35   class LpCplex : public LpSolverBase {
    36 
    37   public:
    38 
    39     typedef LpSolverBase Parent;
    40     
    41     /// \e
    42     int status;
    43     CPXENVptr env;
    44     CPXLPptr lp;
    45 
    46 
    47     /// \e
    48     LpCplex();
    49     /// \e
    50     ~LpCplex();
    51 
    52   protected:
    53     virtual LpSolverBase &_newLp();
    54     virtual LpSolverBase &_copyLp();
    55 
    56     virtual int _addCol();
    57     virtual int _addRow();
    58     virtual void _eraseCol(int i);
    59     virtual void _eraseRow(int i);
    60     virtual void _getColName(int col,       std::string & name);
    61     virtual void _setColName(int col, const std::string & name);
    62     virtual void _setRowCoeffs(int i, 
    63 			       int length,
    64                                const int   * indices, 
    65                                const Value   * values );
    66     virtual void _setColCoeffs(int i, 
    67 			       int length,
    68                                const int   * indices, 
    69                                const Value   * values);
    70     virtual void _setCoeff(int row, int col, Value value);
    71     virtual void _setColLowerBound(int i, Value value);
    72     virtual void _setColUpperBound(int i, Value value);
    73 //     virtual void _setRowLowerBound(int i, Value value);
    74 //     virtual void _setRowUpperBound(int i, Value value);
    75     virtual void _setRowBounds(int i, Value lower, Value upper);
    76     virtual void _setObjCoeff(int i, Value obj_coef);
    77     virtual void _clearObj();
    78     ///\e
    79     
    80     virtual SolveExitStatus _solve();
    81     virtual Value _getPrimal(int i);
    82     virtual Value _getDual(int i);
    83     virtual Value _getPrimalValue();
    84     virtual bool _isBasicCol(int i);
    85     
    86     virtual SolutionStatus _getPrimalStatus();
    87     virtual SolutionStatus _getDualStatus();
    88     virtual ProblemTypes _getProblemType();
    89 
    90     
    91     virtual void _setMax();
    92     virtual void _setMin();
    93 
    94   };
    95 } //END OF NAMESPACE LEMON
    96 
    97 #endif //LEMON_LP_CPLEX_H
    98