deba@458: /* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@458:  *
deba@458:  * This file is a part of LEMON, a generic C++ optimization library.
deba@458:  *
deba@458:  * Copyright (C) 2003-2008
deba@458:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@458:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@458:  *
deba@458:  * Permission to use, modify and distribute this software is granted
deba@458:  * provided that this copyright notice appears in all copies. For
deba@458:  * precise terms see the accompanying LICENSE file.
deba@458:  *
deba@458:  * This software is provided "AS IS" with no warranty of any kind,
deba@458:  * express or implied, and with no claim as to its suitability for any
deba@458:  * purpose.
deba@458:  *
deba@458:  */
deba@458: 
deba@459: #include <iostream>
deba@459: #include <lemon/lp_soplex.h>
deba@458: 
deba@458: #include <soplex/soplex.h>
deba@458: 
deba@458: 
deba@458: ///\file
deba@458: ///\brief Implementation of the LEMON-SOPLEX lp solver interface.
deba@458: namespace lemon {
deba@458: 
deba@459:   LpSoplex::LpSoplex() {
deba@458:     soplex = new soplex::SoPlex;
deba@458:   }
deba@458: 
deba@458:   LpSoplex::~LpSoplex() {
deba@458:     delete soplex;
deba@458:   }
deba@458: 
deba@459:   LpSoplex::LpSoplex(const LpSoplex& lp) {
deba@458:     rows = lp.rows;
deba@458:     cols = lp.cols;
deba@458: 
deba@458:     soplex = new soplex::SoPlex;
deba@458:     (*static_cast<soplex::SPxLP*>(soplex)) = *(lp.soplex);
deba@458: 
deba@459:     _col_names = lp._col_names;
deba@459:     _col_names_ref = lp._col_names_ref;
deba@458: 
deba@459:     _row_names = lp._row_names;
deba@459:     _row_names_ref = lp._row_names_ref;
deba@458: 
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_clear_temporals() {
deba@459:     _primal_values.clear();
deba@459:     _dual_values.clear();
deba@459:   }
deba@459: 
deba@459:   LpSoplex* LpSoplex::_newSolver() const {
deba@458:     LpSoplex* newlp = new LpSoplex();
deba@458:     return newlp;
deba@458:   }
deba@458: 
deba@459:   LpSoplex* LpSoplex::_cloneSolver() const {
deba@458:     LpSoplex* newlp = new LpSoplex(*this);
deba@458:     return newlp;
deba@458:   }
deba@458: 
deba@459:   const char* LpSoplex::_solverName() const { return "LpSoplex"; }
deba@459: 
deba@458:   int LpSoplex::_addCol() {
deba@458:     soplex::LPCol c;
deba@458:     c.setLower(-soplex::infinity);
deba@458:     c.setUpper(soplex::infinity);
deba@458:     soplex->addCol(c);
deba@458: 
deba@459:     _col_names.push_back(std::string());
deba@458: 
deba@458:     return soplex->nCols() - 1;
deba@458:   }
deba@458: 
deba@458:   int LpSoplex::_addRow() {
deba@458:     soplex::LPRow r;
deba@458:     r.setLhs(-soplex::infinity);
deba@458:     r.setRhs(soplex::infinity);
deba@458:     soplex->addRow(r);
deba@458: 
deba@459:     _row_names.push_back(std::string());
deba@458: 
deba@458:     return soplex->nRows() - 1;
deba@458:   }
deba@458: 
deba@458: 
deba@458:   void LpSoplex::_eraseCol(int i) {
deba@458:     soplex->removeCol(i);
deba@459:     _col_names_ref.erase(_col_names[i]);
deba@459:     _col_names[i] = _col_names.back();
deba@459:     _col_names_ref[_col_names.back()] = i;
deba@459:     _col_names.pop_back();
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_eraseRow(int i) {
deba@458:     soplex->removeRow(i);
deba@459:     _row_names_ref.erase(_row_names[i]);
deba@459:     _row_names[i] = _row_names.back();
deba@459:     _row_names_ref[_row_names.back()] = i;
deba@459:     _row_names.pop_back();
deba@459:   }
deba@459: 
deba@459:   void LpSoplex::_eraseColId(int i) {
deba@459:     cols.eraseIndex(i);
deba@459:     cols.relocateIndex(i, cols.maxIndex());
deba@459:   }
deba@459:   void LpSoplex::_eraseRowId(int i) {
deba@459:     rows.eraseIndex(i);
deba@459:     rows.relocateIndex(i, rows.maxIndex());
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_getColName(int c, std::string &name) const {
deba@459:     name = _col_names[c];
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setColName(int c, const std::string &name) {
deba@459:     _col_names_ref.erase(_col_names[c]);
deba@459:     _col_names[c] = name;
deba@458:     if (!name.empty()) {
deba@459:       _col_names_ref.insert(std::make_pair(name, c));
deba@458:     }
deba@458:   }
deba@458: 
deba@458:   int LpSoplex::_colByName(const std::string& name) const {
deba@458:     std::map<std::string, int>::const_iterator it =
deba@459:       _col_names_ref.find(name);
deba@459:     if (it != _col_names_ref.end()) {
deba@458:       return it->second;
deba@458:     } else {
deba@458:       return -1;
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_getRowName(int r, std::string &name) const {
deba@459:     name = _row_names[r];
deba@459:   }
deba@458: 
deba@459:   void LpSoplex::_setRowName(int r, const std::string &name) {
deba@459:     _row_names_ref.erase(_row_names[r]);
deba@459:     _row_names[r] = name;
deba@459:     if (!name.empty()) {
deba@459:       _row_names_ref.insert(std::make_pair(name, r));
deba@459:     }
deba@459:   }
deba@459: 
deba@459:   int LpSoplex::_rowByName(const std::string& name) const {
deba@459:     std::map<std::string, int>::const_iterator it =
deba@459:       _row_names_ref.find(name);
deba@459:     if (it != _row_names_ref.end()) {
deba@459:       return it->second;
deba@459:     } else {
deba@459:       return -1;
deba@459:     }
deba@459:   }
deba@459: 
deba@459: 
deba@459:   void LpSoplex::_setRowCoeffs(int i, ExprIterator b, ExprIterator e) {
deba@458:     for (int j = 0; j < soplex->nCols(); ++j) {
deba@458:       soplex->changeElement(i, j, 0.0);
deba@458:     }
deba@459:     for(ExprIterator it = b; it != e; ++it) {
deba@458:       soplex->changeElement(i, it->first, it->second);
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_getRowCoeffs(int i, InsertIterator b) const {
deba@458:     const soplex::SVector& vec = soplex->rowVector(i);
deba@458:     for (int k = 0; k < vec.size(); ++k) {
deba@458:       *b = std::make_pair(vec.index(k), vec.value(k));
deba@458:       ++b;
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_setColCoeffs(int j, ExprIterator b, ExprIterator e) {
deba@458:     for (int i = 0; i < soplex->nRows(); ++i) {
deba@458:       soplex->changeElement(i, j, 0.0);
deba@458:     }
deba@459:     for(ExprIterator it = b; it != e; ++it) {
deba@458:       soplex->changeElement(it->first, j, it->second);
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_getColCoeffs(int i, InsertIterator b) const {
deba@458:     const soplex::SVector& vec = soplex->colVector(i);
deba@458:     for (int k = 0; k < vec.size(); ++k) {
deba@458:       *b = std::make_pair(vec.index(k), vec.value(k));
deba@458:       ++b;
deba@458:     }
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setCoeff(int i, int j, Value value) {
deba@458:     soplex->changeElement(i, j, value);
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getCoeff(int i, int j) const {
deba@458:     return soplex->rowVector(i)[j];
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setColLowerBound(int i, Value value) {
deba@459:     LEMON_ASSERT(value != INF, "Invalid bound");
deba@458:     soplex->changeLower(i, value != -INF ? value : -soplex::infinity);
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getColLowerBound(int i) const {
deba@458:     double value = soplex->lower(i);
deba@458:     return value != -soplex::infinity ? value : -INF;
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setColUpperBound(int i, Value value) {
deba@459:     LEMON_ASSERT(value != -INF, "Invalid bound");
deba@458:     soplex->changeUpper(i, value != INF ? value : soplex::infinity);
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getColUpperBound(int i) const {
deba@458:     double value = soplex->upper(i);
deba@458:     return value != soplex::infinity ? value : INF;
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_setRowLowerBound(int i, Value lb) {
deba@459:     LEMON_ASSERT(lb != INF, "Invalid bound");
deba@459:     soplex->changeRange(i, lb != -INF ? lb : -soplex::infinity, soplex->rhs(i));
deba@458:   }
deba@459: 
deba@459:   LpSoplex::Value LpSoplex::_getRowLowerBound(int i) const {
deba@459:     double res = soplex->lhs(i);
deba@459:     return res == -soplex::infinity ? -INF : res;
deba@459:   }
deba@459: 
deba@459:   void LpSoplex::_setRowUpperBound(int i, Value ub) {
deba@459:     LEMON_ASSERT(ub != -INF, "Invalid bound");
deba@459:     soplex->changeRange(i, soplex->lhs(i), ub != INF ? ub : soplex::infinity);
deba@459:   }
deba@459: 
deba@459:   LpSoplex::Value LpSoplex::_getRowUpperBound(int i) const {
deba@459:     double res = soplex->rhs(i);
deba@459:     return res == soplex::infinity ? INF : res;
deba@459:   }
deba@459: 
deba@459:   void LpSoplex::_setObjCoeffs(ExprIterator b, ExprIterator e) {
deba@459:     for (int j = 0; j < soplex->nCols(); ++j) {
deba@459:       soplex->changeObj(j, 0.0);
deba@459:     }
deba@459:     for (ExprIterator it = b; it != e; ++it) {
deba@459:       soplex->changeObj(it->first, it->second);
deba@459:     }
deba@459:   }
deba@459: 
deba@459:   void LpSoplex::_getObjCoeffs(InsertIterator b) const {
deba@459:     for (int j = 0; j < soplex->nCols(); ++j) {
deba@459:       Value coef = soplex->obj(j);
deba@459:       if (coef != 0.0) {
deba@459:         *b = std::make_pair(j, coef);
deba@459:         ++b;
deba@459:       }
deba@459:     }
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setObjCoeff(int i, Value obj_coef) {
deba@458:     soplex->changeObj(i, obj_coef);
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getObjCoeff(int i) const {
deba@458:     return soplex->obj(i);
deba@458:   }
deba@458: 
deba@459:   LpSoplex::SolveExitStatus LpSoplex::_solve() {
deba@458: 
deba@459:     _clear_temporals();
deba@459: 
deba@458:     soplex::SPxSolver::Status status = soplex->solve();
deba@458: 
deba@458:     switch (status) {
deba@458:     case soplex::SPxSolver::OPTIMAL:
deba@458:     case soplex::SPxSolver::INFEASIBLE:
deba@458:     case soplex::SPxSolver::UNBOUNDED:
deba@458:       return SOLVED;
deba@458:     default:
deba@458:       return UNSOLVED;
deba@458:     }
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getPrimal(int i) const {
deba@459:     if (_primal_values.empty()) {
deba@459:       _primal_values.resize(soplex->nCols());
deba@459:       soplex::Vector pv(_primal_values.size(), &_primal_values.front());
deba@459:       soplex->getPrimal(pv);
deba@459:     }
deba@459:     return _primal_values[i];
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getDual(int i) const {
deba@459:     if (_dual_values.empty()) {
deba@459:       _dual_values.resize(soplex->nRows());
deba@459:       soplex::Vector dv(_dual_values.size(), &_dual_values.front());
deba@459:       soplex->getDual(dv);
deba@459:     }
deba@459:     return _dual_values[i];
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getPrimalValue() const {
deba@458:     return soplex->objValue();
deba@458:   }
deba@458: 
deba@459:   LpSoplex::VarStatus LpSoplex::_getColStatus(int i) const {
deba@459:     switch (soplex->getBasisColStatus(i)) {
deba@459:     case soplex::SPxSolver::BASIC:
deba@459:       return BASIC;
deba@459:     case soplex::SPxSolver::ON_UPPER:
deba@459:       return UPPER;
deba@459:     case soplex::SPxSolver::ON_LOWER:
deba@459:       return LOWER;
deba@459:     case soplex::SPxSolver::FIXED:
deba@459:       return FIXED;
deba@459:     case soplex::SPxSolver::ZERO:
deba@459:       return FREE;
deba@459:     default:
deba@459:       LEMON_ASSERT(false, "Wrong column status");
deba@459:       return VarStatus();
deba@459:     }
deba@458:   }
deba@458: 
deba@459:   LpSoplex::VarStatus LpSoplex::_getRowStatus(int i) const {
deba@459:     switch (soplex->getBasisRowStatus(i)) {
deba@459:     case soplex::SPxSolver::BASIC:
deba@459:       return BASIC;
deba@459:     case soplex::SPxSolver::ON_UPPER:
deba@459:       return UPPER;
deba@459:     case soplex::SPxSolver::ON_LOWER:
deba@459:       return LOWER;
deba@459:     case soplex::SPxSolver::FIXED:
deba@459:       return FIXED;
deba@459:     case soplex::SPxSolver::ZERO:
deba@459:       return FREE;
deba@459:     default:
deba@459:       LEMON_ASSERT(false, "Wrong row status");
deba@459:       return VarStatus();
deba@459:     }
deba@459:   }
deba@459: 
deba@459:   LpSoplex::Value LpSoplex::_getPrimalRay(int i) const {
deba@459:     if (_primal_ray.empty()) {
deba@459:       _primal_ray.resize(soplex->nCols());
deba@459:       soplex::Vector pv(_primal_ray.size(), &_primal_ray.front());
deba@459:       soplex->getDualfarkas(pv);
deba@459:     }
deba@459:     return _primal_ray[i];
deba@459:   }
deba@459: 
deba@459:   LpSoplex::Value LpSoplex::_getDualRay(int i) const {
deba@459:     if (_dual_ray.empty()) {
deba@459:       _dual_ray.resize(soplex->nRows());
deba@459:       soplex::Vector dv(_dual_ray.size(), &_dual_ray.front());
deba@459:       soplex->getDualfarkas(dv);
deba@459:     }
deba@459:     return _dual_ray[i];
deba@459:   }
deba@459: 
deba@459:   LpSoplex::ProblemType LpSoplex::_getPrimalType() const {
deba@458:     switch (soplex->status()) {
deba@458:     case soplex::SPxSolver::OPTIMAL:
deba@458:       return OPTIMAL;
deba@458:     case soplex::SPxSolver::UNBOUNDED:
deba@459:       return UNBOUNDED;
deba@458:     case soplex::SPxSolver::INFEASIBLE:
deba@458:       return INFEASIBLE;
deba@458:     default:
deba@458:       return UNDEFINED;
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   LpSoplex::ProblemType LpSoplex::_getDualType() const {
deba@458:     switch (soplex->status()) {
deba@458:     case soplex::SPxSolver::OPTIMAL:
deba@458:       return OPTIMAL;
deba@458:     case soplex::SPxSolver::UNBOUNDED:
deba@459:       return UNBOUNDED;
deba@459:     case soplex::SPxSolver::INFEASIBLE:
deba@458:       return INFEASIBLE;
deba@458:     default:
deba@458:       return UNDEFINED;
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_setSense(Sense sense) {
deba@459:     switch (sense) {
deba@459:     case MIN:
deba@459:       soplex->changeSense(soplex::SPxSolver::MINIMIZE);
deba@459:       break;
deba@459:     case MAX:
deba@459:       soplex->changeSense(soplex::SPxSolver::MAXIMIZE);
deba@458:     }
deba@458:   }
deba@458: 
deba@459:   LpSoplex::Sense LpSoplex::_getSense() const {
deba@459:     switch (soplex->spxSense()) {
deba@459:     case soplex::SPxSolver::MAXIMIZE:
deba@459:       return MAX;
deba@459:     case soplex::SPxSolver::MINIMIZE:
deba@459:       return MIN;
deba@459:     default:
deba@459:       LEMON_ASSERT(false, "Wrong sense.");
deba@459:       return LpSoplex::Sense();
deba@459:     }
deba@458:   }
deba@458: 
deba@459:   void LpSoplex::_clear() {
deba@459:     soplex->clear();
deba@459:     _col_names.clear();
deba@459:     _col_names_ref.clear();
deba@459:     _row_names.clear();
deba@459:     _row_names_ref.clear();
deba@459:     cols.clear();
deba@459:     rows.clear();
deba@459:     _clear_temporals();
deba@459:   }
deba@458: 
deba@458: } //namespace lemon
deba@458: