lemon/lp_soplex.h
author deba
Wed, 08 Oct 2008 09:17:01 +0000
changeset 2624 dc4dd5fc0e25
parent 2553 bfced05fa852
permissions -rw-r--r--
Bug fixes is HaoOrlin and MinCostArborescence

MinCostArborescence
- proper deallocation
HaoOrlin
- the target needn't to be the last in its bucket
- proper size of container (if each node starts in different buckets initially)
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2008
     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_SOPLEX_H
    20 #define LEMON_LP_SOPLEX_H
    21 
    22 ///\file
    23 ///\brief Header of the LEMON-SOPLEX lp solver interface.
    24 
    25 #include <vector>
    26 #include <string>
    27 
    28 #include <lemon/lp_base.h>
    29 
    30 // Forward declaration
    31 namespace soplex {
    32   class SoPlex;
    33 }
    34 
    35 namespace lemon {
    36 
    37   /// \ingroup lp_group
    38   ///
    39   /// \brief Interface for the SOPLEX solver
    40   /// 
    41   /// This class implements an interface for the SoPlex LP solver.
    42   /// The SoPlex library is an object oriented lp solver library
    43   /// developed at the Konrad-Zuse-Zentrum für Informationstechnik
    44   /// Berlin (ZIB). You can find detailed information about it at the
    45   /// <tt>http://soplex.zib.de</tt> address.
    46   class LpSoplex :virtual public LpSolverBase {
    47   protected:
    48 
    49     _lp_bits::RelocateIdHandler relocateIdHandler;
    50 
    51     soplex::SoPlex* soplex;
    52     bool solved;
    53 
    54     std::vector<std::string> colNames;
    55     std::map<std::string, int> invColNames;
    56 
    57     std::vector<Value> primal_value;
    58     std::vector<Value> dual_value;
    59 
    60 
    61   public:
    62 
    63     typedef LpSolverBase Parent;
    64     
    65 
    66     /// \e
    67     LpSoplex();
    68     /// \e
    69     LpSoplex(const LpSoplex&);
    70     /// \e
    71     ~LpSoplex();
    72 
    73   protected:
    74 
    75     virtual LpSolverBase* _newLp();
    76     virtual LpSolverBase* _copyLp();
    77 
    78     virtual int _addCol();
    79     virtual int _addRow();
    80     virtual void _eraseCol(int i);
    81     virtual void _eraseRow(int i);
    82     virtual void _getColName(int col, std::string & name) const;
    83     virtual void _setColName(int col, const std::string & name);
    84     virtual int _colByName(const std::string& name) const;
    85     virtual void _setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e);
    86     virtual void _getRowCoeffs(int i, RowIterator b) const;
    87     virtual void _setColCoeffs(int i, ConstColIterator b, ConstColIterator e);
    88     virtual void _getColCoeffs(int i, ColIterator b) const;
    89     virtual void _setCoeff(int row, int col, Value value);
    90     virtual Value _getCoeff(int row, int col) const;
    91     virtual void _setColLowerBound(int i, Value value);
    92     virtual Value _getColLowerBound(int i) const;
    93     virtual void _setColUpperBound(int i, Value value);
    94     virtual Value _getColUpperBound(int i) const;
    95     virtual void _setRowBounds(int i, Value lower, Value upper);
    96     virtual void _getRowBounds(int i, Value &lower, Value &upper) const;
    97     virtual void _setObjCoeff(int i, Value obj_coef);
    98     virtual Value _getObjCoeff(int i) const;
    99     virtual void _clearObj();
   100     
   101     virtual SolveExitStatus _solve();
   102     virtual Value _getPrimal(int i) const;
   103     virtual Value _getDual(int i) const;
   104     virtual Value _getPrimalValue() const;
   105     virtual bool _isBasicCol(int i) const;
   106     
   107     virtual SolutionStatus _getPrimalStatus() const;
   108     virtual SolutionStatus _getDualStatus() const;
   109     virtual ProblemTypes _getProblemType() const;
   110 
   111     
   112     virtual void _setMax();
   113     virtual void _setMin();
   114     virtual bool _isMax() const;
   115 
   116   };
   117 } //END OF NAMESPACE LEMON
   118 
   119 #endif //LEMON_LP_SOPLEX_H
   120