lemon/lp_cplex.h
author deba
Sun, 30 Dec 2007 18:23:32 +0000
changeset 2550 f26368148b9c
parent 2366 bfbdded3763a
child 2553 bfced05fa852
permissions -rw-r--r--
Changing degree of tournament tree
Bug fix in union find
Small efficiency improvment in bipartite matchings
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2007
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 
    19 #ifndef LEMON_LP_CPLEX_H
    20 #define LEMON_LP_CPLEX_H
    21 
    22 ///\file
    23 ///\brief Header of the LEMON-CPLEX lp solver interface.
    24 
    25 #include <lemon/lp_base.h>
    26 
    27 extern "C" {
    28 #include <ilcplex/cplex.h>
    29 }
    30 
    31 namespace lemon {
    32 
    33 
    34   /// \brief Interface for the CPLEX solver
    35   /// 
    36   /// This class implements an interface for the CPLEX LP solver.
    37   class LpCplex :virtual public LpSolverBase {
    38 
    39   public:
    40 
    41     typedef LpSolverBase Parent;
    42     
    43     /// \e
    44     int status;
    45     CPXENVptr env;
    46     CPXLPptr lp;
    47 
    48 
    49     /// \e
    50     LpCplex();
    51     /// \e
    52     ~LpCplex();
    53 
    54   protected:
    55     virtual LpSolverBase &_newLp();
    56     virtual LpSolverBase &_copyLp();
    57 
    58 
    59     virtual int _addCol();
    60     virtual int _addRow();
    61     virtual void _eraseCol(int i);
    62     virtual void _eraseRow(int i);
    63     virtual void _getColName(int col, std::string & name) const;
    64     virtual void _setColName(int col, const std::string & name);
    65     virtual int _colByName(const std::string& name) const;
    66     virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e);
    67     virtual void _getRowCoeffs(int i, RowIterator b) const;
    68     virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e);
    69     virtual void _getColCoeffs(int i, ColIterator b) const;
    70     virtual void _setCoeff(int row, int col, Value value);
    71     virtual Value _getCoeff(int row, int col) const;
    72 
    73     virtual void _setColLowerBound(int i, Value value);
    74     virtual Value _getColLowerBound(int i) const;
    75     virtual void _setColUpperBound(int i, Value value);
    76     virtual Value _getColUpperBound(int i) const;
    77 
    78 //     virtual void _setRowLowerBound(int i, Value value);
    79 //     virtual void _setRowUpperBound(int i, Value value);
    80     virtual void _setRowBounds(int i, Value lower, Value upper);
    81     virtual void _getRowBounds(int i, Value &lb, Value &ub) const;
    82     virtual void _setObjCoeff(int i, Value obj_coef);
    83     virtual Value _getObjCoeff(int i) const;
    84     virtual void _clearObj();
    85 
    86     
    87     virtual SolveExitStatus _solve();
    88     virtual Value _getPrimal(int i) const;
    89     virtual Value _getDual(int i) const;
    90     virtual Value _getPrimalValue() const;
    91     virtual bool _isBasicCol(int i) const;
    92     
    93     virtual SolutionStatus _getPrimalStatus() const;
    94     virtual SolutionStatus _getDualStatus() const;
    95     virtual ProblemTypes _getProblemType() const;
    96 
    97     
    98     virtual void _setMax();
    99     virtual void _setMin();
   100 
   101     virtual bool _isMax() const;
   102 
   103   };
   104 } //END OF NAMESPACE LEMON
   105 
   106 #endif //LEMON_LP_CPLEX_H
   107