RhodeCode

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2008

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <iostream>

#include <lemon/soplex.h>

///\file

///\brief Implementation of the LEMON-SOPLEX lp solver interface.

namespace lemon {

  SoplexLp::SoplexLp() {

    soplex = new soplex::SoPlex;

  }

  SoplexLp::~SoplexLp() {

    delete soplex;

  }

  SoplexLp::SoplexLp(const SoplexLp& lp) {

    rows = lp.rows;

    cols = lp.cols;

    soplex = new soplex::SoPlex;

    (*static_cast<soplex::SPxLP*>(soplex)) = *(lp.soplex);

    _col_names = lp._col_names;

    _col_names_ref = lp._col_names_ref;

    _row_names = lp._row_names;

    _row_names_ref = lp._row_names_ref;

  }

  void SoplexLp::_clear_temporals() {

    _primal_values.clear();

    _dual_values.clear();

  }

  SoplexLp* SoplexLp::_newSolver() const {

    SoplexLp* newlp = new SoplexLp();

    return newlp;

  }

  SoplexLp* SoplexLp::_cloneSolver() const {

    SoplexLp* newlp = new SoplexLp(*this);

    return newlp;

  }

  const char* SoplexLp::_solverName() const { return "SoplexLp"; }

  int SoplexLp::_addCol() {

    soplex::LPCol c;

    c.setLower(-soplex::infinity);

    c.setUpper(soplex::infinity);

    soplex->addCol(c);

    _col_names.push_back(std::string());

    return soplex->nCols() - 1;

  }

  int SoplexLp::_addRow() {

    soplex::LPRow r;

    r.setLhs(-soplex::infinity);

    r.setRhs(soplex::infinity);

    soplex->addRow(r);

    _row_names.push_back(std::string());

    return soplex->nRows() - 1;

  }

  void SoplexLp::_eraseCol(int i) {

    soplex->removeCol(i);

    _col_names_ref.erase(_col_names[i]);

    _col_names[i] = _col_names.back();

    _col_names_ref[_col_names.back()] = i;

    _col_names.pop_back();

  }

  void SoplexLp::_eraseRow(int i) {

    soplex->removeRow(i);

    _row_names_ref.erase(_row_names[i]);

    _row_names[i] = _row_names.back();

    _row_names_ref[_row_names.back()] = i;

    _row_names.pop_back();

  }

  void SoplexLp::_eraseColId(int i) {

    cols.eraseIndex(i);

    cols.relocateIndex(i, cols.maxIndex());

  }

  void SoplexLp::_eraseRowId(int i) {

    rows.eraseIndex(i);

    rows.relocateIndex(i, rows.maxIndex());

  }

  void SoplexLp::_getColName(int c, std::string &name) const {

    name = _col_names[c];

  }

  void SoplexLp::_setColName(int c, const std::string &name) {

    _col_names_ref.erase(_col_names[c]);

    _col_names[c] = name;

    if (!name.empty()) {

      _col_names_ref.insert(std::make_pair(name, c));

    }

  }

  int SoplexLp::_colByName(const std::string& name) const {

    std::map<std::string, int>::const_iterator it =

      _col_names_ref.find(name);

    if (it != _col_names_ref.end()) {

      return it->second;

    } else {

      return -1;

    }

  }

  void SoplexLp::_getRowName(int r, std::string &name) const {

    name = _row_names[r];

  }

  void SoplexLp::_setRowName(int r, const std::string &name) {

    _row_names_ref.erase(_row_names[r]);

    _row_names[r] = name;

    if (!name.empty()) {

      _row_names_ref.insert(std::make_pair(name, r));

    }

  }

  int SoplexLp::_rowByName(const std::string& name) const {

    std::map<std::string, int>::const_iterator it =

      _row_names_ref.find(name);

    if (it != _row_names_ref.end()) {

      return it->second;

    } else {

      return -1;

    }

  }

  void SoplexLp::_setRowCoeffs(int i, ExprIterator b, ExprIterator e) {

    for (int j = 0; j < soplex->nCols(); ++j) {

      soplex->changeElement(i, j, 0.0);

    }

    for(ExprIterator it = b; it != e; ++it) {

      soplex->changeElement(i, it->first, it->second);

    }

  }

  void SoplexLp::_getRowCoeffs(int i, InsertIterator b) const {

    const soplex::SVector& vec = soplex->rowVector(i);

    for (int k = 0; k < vec.size(); ++k) {

      *b = std::make_pair(vec.index(k), vec.value(k));

      ++b;

    }

  }

  void SoplexLp::_setColCoeffs(int j, ExprIterator b, ExprIterator e) {

    for (int i = 0; i < soplex->nRows(); ++i) {

      soplex->changeElement(i, j, 0.0);

    }

    for(ExprIterator it = b; it != e; ++it) {

      soplex->changeElement(it->first, j, it->second);

    }

  }

  void SoplexLp::_getColCoeffs(int i, InsertIterator b) const {

    const soplex::SVector& vec = soplex->colVector(i);

    for (int k = 0; k < vec.size(); ++k) {

      *b = std::make_pair(vec.index(k), vec.value(k));

      ++b;

    }

  }

  void SoplexLp::_setCoeff(int i, int j, Value value) {

    soplex->changeElement(i, j, value);

  }

  SoplexLp::Value SoplexLp::_getCoeff(int i, int j) const {

    return soplex->rowVector(i)[j];

  }

  void SoplexLp::_setColLowerBound(int i, Value value) {

    LEMON_ASSERT(value != INF, "Invalid bound");

    soplex->changeLower(i, value != -INF ? value : -soplex::infinity);

  }

  SoplexLp::Value SoplexLp::_getColLowerBound(int i) const {

    double value = soplex->lower(i);

    return value != -soplex::infinity ? value : -INF;

  }

  void SoplexLp::_setColUpperBound(int i, Value value) {

AC_DEFUN([LX_CHECK_SOPLEX],

[

  AC_ARG_WITH([soplex],

AS_HELP_STRING([--with-soplex@<:@=PREFIX@:>@], [search for SOPLEX under PREFIX or under the default search paths if PREFIX is not given @<:@default@:>@])

AS_HELP_STRING([--without-soplex], [disable checking for SOPLEX]),

              [], [with_soplex=yes])

  AC_ARG_WITH([soplex-includedir],

AS_HELP_STRING([--with-soplex-includedir=DIR], [search for SOPLEX headers in DIR]),

              [], [with_soplex_includedir=no])

  AC_ARG_WITH([soplex-libdir],

AS_HELP_STRING([--with-soplex-libdir=DIR], [search for SOPLEX libraries in DIR]),

              [], [with_soplex_libdir=no])

  lx_soplex_found=no

  if test x"$with_soplex" != x"no"; then

    AC_MSG_CHECKING([for SOPLEX])

    if test x"$with_soplex_includedir" != x"no"; then

      SOPLEX_CXXFLAGS="-I$with_soplex_includedir"

    elif test x"$with_soplex" != x"yes"; then

    fi

    if test x"$with_soplex_libdir" != x"no"; then

      SOPLEX_LDFLAGS="-L$with_soplex_libdir"

    elif test x"$with_soplex" != x"yes"; then

      SOPLEX_LDFLAGS="-L$with_soplex/lib"

    fi

    SOPLEX_LIBS="-lsoplex -lz"

    lx_save_cxxflags="$CXXFLAGS"

    lx_save_ldflags="$LDFLAGS"

    lx_save_libs="$LIBS"

    CXXFLAGS="$SOPLEX_CXXFLAGS"

    LDFLAGS="$SOPLEX_LDFLAGS"

    LIBS="$SOPLEX_LIBS"

    lx_soplex_test_prog='

      int main(int argc, char** argv)

      {

        soplex::SoPlex soplex;

        return 0;

      }'

    AC_LANG_PUSH(C++)

    AC_LINK_IFELSE([$lx_soplex_test_prog], [lx_soplex_found=yes], [lx_soplex_found=no])

    AC_LANG_POP(C++)

    CXXFLAGS="$lx_save_cxxflags"

    LDFLAGS="$lx_save_ldflags"

    LIBS="$lx_save_libs"

    if test x"$lx_soplex_found" = x"yes"; then

      AC_DEFINE([HAVE_SOPLEX], [1], [Define to 1 if you have SOPLEX.])

      lx_lp_found=yes

      AC_DEFINE([HAVE_LP], [1], [Define to 1 if you have any LP solver.])

      AC_MSG_RESULT([yes])

    else

      SOPLEX_CXXFLAGS=""

      SOPLEX_LDFLAGS=""

      SOPLEX_LIBS=""

      AC_MSG_RESULT([no])

    fi

  fi

  SOPLEX_LIBS="$SOPLEX_LDFLAGS $SOPLEX_LIBS"

  AC_SUBST(SOPLEX_CXXFLAGS)

  AC_SUBST(SOPLEX_LIBS)

  AM_CONDITIONAL([HAVE_SOPLEX], [test x"$lx_soplex_found" = x"yes"])

])