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@458: #include<iostream>
deba@458: #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@458:   LpSoplex::LpSoplex() : LpSolverBase() {
deba@458:     rows.setIdHandler(relocateIdHandler);
deba@458:     cols.setIdHandler(relocateIdHandler);
deba@458:     soplex = new soplex::SoPlex;
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   LpSoplex::~LpSoplex() {
deba@458:     delete soplex;
deba@458:   }
deba@458: 
deba@458:   LpSoplex::LpSoplex(const LpSoplex& lp) : LpSolverBase() {
deba@458:     rows = lp.rows;
deba@458:     rows.setIdHandler(relocateIdHandler);
deba@458: 
deba@458:     cols = lp.cols;
deba@458:     cols.setIdHandler(relocateIdHandler);
deba@458: 
deba@458:     soplex = new soplex::SoPlex;
deba@458:     (*static_cast<soplex::SPxLP*>(soplex)) = *(lp.soplex);
deba@458: 
deba@458:     colNames = lp.colNames;
deba@458:     invColNames = lp.invColNames;
deba@458: 
deba@458:     primal_value = lp.primal_value;
deba@458:     dual_value = lp.dual_value;
deba@458: 
deba@458:   }
deba@458: 
deba@458:   LpSolverBase* LpSoplex::_newLp() {
deba@458:     LpSoplex* newlp = new LpSoplex();
deba@458:     return newlp;
deba@458:   }
deba@458: 
deba@458:   LpSolverBase* LpSoplex::_copyLp() {
deba@458:     LpSoplex* newlp = new LpSoplex(*this);
deba@458:     return newlp;
deba@458:   }
deba@458: 
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@458:     colNames.push_back(std::string());
deba@458:     primal_value.push_back(0.0);
deba@458:     solved = false;
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@458:     dual_value.push_back(0.0);
deba@458:     solved = false;
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@458:     invColNames.erase(colNames[i]);
deba@458:     colNames[i] = colNames.back();
deba@458:     invColNames[colNames.back()] = i;
deba@458:     colNames.pop_back();
deba@458:     primal_value[i] = primal_value.back();
deba@458:     primal_value.pop_back();
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_eraseRow(int i) {
deba@458:     soplex->removeRow(i);
deba@458:     dual_value[i] = dual_value.back();
deba@458:     dual_value.pop_back();
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_getColName(int c, std::string &name) const {
deba@458:     name = colNames[c];
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setColName(int c, const std::string &name) {
deba@458:     invColNames.erase(colNames[c]);
deba@458:     colNames[c] = name;
deba@458:     if (!name.empty()) {
deba@458:       invColNames.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@458:       invColNames.find(name);
deba@458:     if (it != invColNames.end()) {
deba@458:       return it->second;
deba@458:     } else {
deba@458:       return -1;
deba@458:     }
deba@458:   }
deba@458: 
deba@458: 
deba@458:   void LpSoplex::_setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e) {
deba@458:     for (int j = 0; j < soplex->nCols(); ++j) {
deba@458:       soplex->changeElement(i, j, 0.0);
deba@458:     }
deba@458:     for(ConstRowIterator it = b; it != e; ++it) {
deba@458:       soplex->changeElement(i, it->first, it->second);
deba@458:     }
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_getRowCoeffs(int i, RowIterator 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@458:   void LpSoplex::_setColCoeffs(int j, ConstColIterator b, ConstColIterator e) {
deba@458:     for (int i = 0; i < soplex->nRows(); ++i) {
deba@458:       soplex->changeElement(i, j, 0.0);
deba@458:     }
deba@458:     for(ConstColIterator it = b; it != e; ++it) {
deba@458:       soplex->changeElement(it->first, j, it->second);
deba@458:     }
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_getColCoeffs(int i, ColIterator 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:     solved = false;
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@458:     soplex->changeLower(i, value != -INF ? value : -soplex::infinity);
deba@458:     solved = false;
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@458:     soplex->changeUpper(i, value != INF ? value : soplex::infinity);
deba@458:     solved = false;
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@458:   void LpSoplex::_setRowBounds(int i, Value lb, Value ub) {
deba@458:     soplex->changeRange(i, lb != -INF ? lb : -soplex::infinity,
deba@458:                         ub != INF ? ub : soplex::infinity);
deba@458:     solved = false;
deba@458:   }
deba@458:   void LpSoplex::_getRowBounds(int i, Value &lower, Value &upper) const {
deba@458:     lower = soplex->lhs(i);
deba@458:     if (lower == -soplex::infinity) lower = -INF;
deba@458:     upper = soplex->rhs(i);
deba@458:     if (upper == -soplex::infinity) upper = INF;
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setObjCoeff(int i, Value obj_coef) {
deba@458:     soplex->changeObj(i, obj_coef);
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getObjCoeff(int i) const {
deba@458:     return soplex->obj(i);
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_clearObj() {
deba@458:     for (int i = 0; i < soplex->nCols(); ++i) {
deba@458:       soplex->changeObj(i, 0.0);
deba@458:     }
deba@458:     solved = false;
deba@458:   }
deba@458: 
deba@458:   LpSoplex::SolveExitStatus LpSoplex::_solve() {
deba@458:     soplex::SPxSolver::Status status = soplex->solve();
deba@458: 
deba@458:     soplex::Vector pv(primal_value.size(), &primal_value[0]);
deba@458:     soplex->getPrimal(pv);
deba@458: 
deba@458:     soplex::Vector dv(dual_value.size(), &dual_value[0]);
deba@458:     soplex->getDual(dv);
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:       solved = true;
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@458:     return primal_value[i];
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getDual(int i) const {
deba@458:     return dual_value[i];
deba@458:   }
deba@458: 
deba@458:   LpSoplex::Value LpSoplex::_getPrimalValue() const {
deba@458:     return soplex->objValue();
deba@458:   }
deba@458: 
deba@458:   bool LpSoplex::_isBasicCol(int i) const {
deba@458:     return soplex->getBasisColStatus(i) == soplex::SPxSolver::BASIC;
deba@458:   }
deba@458: 
deba@458:   LpSoplex::SolutionStatus LpSoplex::_getPrimalStatus() const {
deba@458:     if (!solved) return UNDEFINED;
deba@458:     switch (soplex->status()) {
deba@458:     case soplex::SPxSolver::OPTIMAL:
deba@458:       return OPTIMAL;
deba@458:     case soplex::SPxSolver::UNBOUNDED:
deba@458:       return INFINITE;
deba@458:     case soplex::SPxSolver::INFEASIBLE:
deba@458:       return INFEASIBLE;
deba@458:     default:
deba@458:       return UNDEFINED;
deba@458:     }
deba@458:   }
deba@458: 
deba@458:   LpSoplex::SolutionStatus LpSoplex::_getDualStatus() const {
deba@458:     if (!solved) return UNDEFINED;
deba@458:     switch (soplex->status()) {
deba@458:     case soplex::SPxSolver::OPTIMAL:
deba@458:       return OPTIMAL;
deba@458:     case soplex::SPxSolver::UNBOUNDED:
deba@458:       return INFEASIBLE;
deba@458:     default:
deba@458:       return UNDEFINED;
deba@458:     }
deba@458:   }
deba@458: 
deba@458:   LpSoplex::ProblemTypes LpSoplex::_getProblemType() const {
deba@458:     if (!solved) return UNKNOWN;
deba@458:     switch (soplex->status()) {
deba@458:     case soplex::SPxSolver::OPTIMAL:
deba@458:       return PRIMAL_DUAL_FEASIBLE;
deba@458:     case soplex::SPxSolver::UNBOUNDED:
deba@458:       return PRIMAL_FEASIBLE_DUAL_INFEASIBLE;
deba@458:     default:
deba@458:       return UNKNOWN;
deba@458:     }
deba@458:   }
deba@458: 
deba@458:   void LpSoplex::_setMax() {
deba@458:     soplex->changeSense(soplex::SPxSolver::MAXIMIZE);
deba@458:     solved = false;
deba@458:   }
deba@458:   void LpSoplex::_setMin() {
deba@458:     soplex->changeSense(soplex::SPxSolver::MINIMIZE);
deba@458:     solved = false;
deba@458:   }
deba@458:   bool LpSoplex::_isMax() const {
deba@458:     return soplex->spxSense() == soplex::SPxSolver::MAXIMIZE;
deba@458:   }
deba@458: 
deba@458: 
deba@458: } //namespace lemon
deba@458: