deba@2313: /* -*- C++ -*-
deba@2313:  *
deba@2313:  * This file is a part of LEMON, a generic C++ optimization library
deba@2313:  *
deba@2313:  * Copyright (C) 2003-2006
deba@2313:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@2313:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@2313:  *
deba@2313:  * Permission to use, modify and distribute this software is granted
deba@2313:  * provided that this copyright notice appears in all copies. For
deba@2313:  * precise terms see the accompanying LICENSE file.
deba@2313:  *
deba@2313:  * This software is provided "AS IS" with no warranty of any kind,
deba@2313:  * express or implied, and with no claim as to its suitability for any
deba@2313:  * purpose.
deba@2313:  *
deba@2313:  */
deba@2313: 
deba@2313: #include<iostream>
deba@2313: #include<lemon/lp_soplex.h>
deba@2313: 
deba@2313: #include <soplex/soplex.h>
deba@2313: 
deba@2313: 
deba@2313: ///\file
deba@2313: ///\brief Implementation of the LEMON-SOPLEX lp solver interface.
deba@2313: namespace lemon {
deba@2313:   
deba@2313:   LpSoplex::LpSoplex() : LpSolverBase() {
deba@2313:     soplex = new soplex::SoPlex;
deba@2313:   }
deba@2313:   
deba@2313:   LpSoplex::~LpSoplex() {
deba@2313:     delete soplex;
deba@2313:   }
deba@2313:   
deba@2313:   LpSolverBase &LpSoplex::_newLp() {
deba@2313:     LpSoplex* newlp = new LpSoplex();
deba@2313:     return *newlp;
deba@2313:   }
deba@2313: 
deba@2313:   LpSolverBase &LpSoplex::_copyLp() {
deba@2313:     LpSoplex* newlp = new LpSoplex();
deba@2313:     ((soplex::SPxLP&)*(newlp->soplex)) = *soplex;
deba@2313:     return *newlp;
deba@2313:   }
deba@2313: 
deba@2313:   int LpSoplex::_addCol() {
deba@2313:     soplex::LPCol col;
deba@2313:     soplex->addCol(col);
deba@2313: 
deba@2313:     colNames.push_back(std::string());
deba@2313:     primal.push_back(0.0);
deba@2313: 
deba@2313:     return soplex->nCols() - 1;
deba@2313:   }
deba@2313: 
deba@2313:   int LpSoplex::_addRow() {
deba@2313:     soplex::LPRow row;
deba@2313:     soplex->addRow(row);
deba@2313: 
deba@2313:     dual.push_back(0.0);
deba@2313: 
deba@2313:     return soplex->nRows() - 1;
deba@2313:   }
deba@2313: 
deba@2313: 
deba@2313:   void LpSoplex::_eraseCol(int i) {
deba@2313:     soplex->removeCol(i);
deba@2313:     primal[i] = primal.back();
deba@2313:     primal.pop_back();
deba@2313:   }
deba@2313:   
deba@2313:   void LpSoplex::_eraseRow(int i) {
deba@2313:     soplex->removeRow(i);
deba@2313:     dual[i] = dual.back();
deba@2313:     dual.pop_back();
deba@2313:   }
deba@2313:   
deba@2313:   void LpSoplex::_getColName(int col, std::string &name) {
deba@2313:     name = colNames[col]; 
deba@2313:   }
deba@2313:   
deba@2313:   void LpSoplex::_setColName(int col, const std::string &name) {
deba@2313:     colNames[col] = name; 
deba@2313:   }
deba@2313:   
deba@2313: 
deba@2313:   void LpSoplex::_setRowCoeffs(int i, LpRowIterator b, LpRowIterator e) {
deba@2313:     for (int j = 0; j < soplex->nCols(); ++j) {
deba@2313:       soplex->changeElement(i, j, 0.0);
deba@2313:     }
deba@2313:     for(LpRowIterator it = b; it != e; ++it) {
deba@2313:       soplex->changeElement(i, it->first, it->second);
deba@2313:     }
deba@2313:   }
deba@2313:   
deba@2313:   void LpSoplex::_setColCoeffs(int j, LpColIterator b, LpColIterator e) {
deba@2313:     for (int i = 0; i < soplex->nRows(); ++i) {
deba@2313:       soplex->changeElement(i, j, 0.0);
deba@2313:     }
deba@2313:     for(LpColIterator it = b; it != e; ++it) {
deba@2313:       soplex->changeElement(it->first, j, it->second);
deba@2313:     }
deba@2313:   }
deba@2313:   
deba@2313:   void LpSoplex::_setCoeff(int row, int col, Value value) {
deba@2313:     soplex->changeElement(row, col, value);
deba@2313:   }
deba@2313: 
deba@2313:   void LpSoplex::_setColLowerBound(int i, Value value) {
deba@2313:     soplex->changeLower(i, value); 
deba@2313:   }
deba@2313:   
deba@2313:   void LpSoplex::_setColUpperBound(int i, Value value) {
deba@2313:     soplex->changeUpper(i, value); 
deba@2313:   }
deba@2313: 
deba@2313:   void LpSoplex::_setRowBounds(int i, Value lb, Value ub) {
deba@2313:     soplex->changeRange(i, lb, ub);
deba@2313:   }
deba@2313: 
deba@2313:   void LpSoplex::_setObjCoeff(int i, Value obj_coef) {
deba@2313:     soplex->changeObj(i, obj_coef);
deba@2313:   }
deba@2313: 
deba@2313:   void LpSoplex::_clearObj() {
deba@2313:     for (int i = 0; i < soplex->nCols(); ++i) {
deba@2313:       soplex->changeObj(i, 0.0);
deba@2313:     }
deba@2313:   }
deba@2313: 
deba@2313:   LpSoplex::SolveExitStatus LpSoplex::_solve() {
deba@2313:     soplex::SPxSolver::Status status = soplex->solve();
deba@2313: 
deba@2313:     soplex::Vector pv(primal.size(), &primal[0]);
deba@2313:     soplex->getPrimal(pv);
deba@2313: 
deba@2313:     soplex::Vector dv(dual.size(), &dual[0]);
deba@2313:     soplex->getDual(dv);
deba@2313: 
deba@2313:     switch (status) {
deba@2313:     case soplex::SPxSolver::OPTIMAL:
deba@2313:     case soplex::SPxSolver::INFEASIBLE:
deba@2313:     case soplex::SPxSolver::UNBOUNDED:
deba@2313:       return SOLVED;
deba@2313:     default:
deba@2313:       return UNSOLVED;
deba@2313:     }
deba@2313:   }
deba@2313: 
deba@2313:   LpSoplex::Value LpSoplex::_getPrimal(int i) {
deba@2313:     return primal[i];
deba@2313:   }
deba@2313: 
deba@2313:   LpSoplex::Value LpSoplex::_getDual(int i) {
deba@2313:     return dual[i];
deba@2313:   }
deba@2313:   
deba@2313:   LpSoplex::Value LpSoplex::_getPrimalValue() {
deba@2313:     return soplex->objValue();
deba@2313:   }
deba@2313: 
deba@2313:   bool LpSoplex::_isBasicCol(int i) {
deba@2313:     return soplex->getBasisColStatus(i) == soplex::SPxSolver::BASIC;
deba@2313:   }  
deba@2313: 
deba@2313:   LpSoplex::SolutionStatus LpSoplex::_getPrimalStatus() {
deba@2313:     switch (soplex->status()) {
deba@2313:     case soplex::SPxSolver::OPTIMAL:
deba@2313:       return OPTIMAL;
deba@2313:     case soplex::SPxSolver::UNBOUNDED:
deba@2313:       return INFINITE;
deba@2313:     case soplex::SPxSolver::INFEASIBLE:
deba@2313:       return INFEASIBLE;
deba@2313:     default:
deba@2313:       return UNDEFINED;
deba@2313:     }
deba@2313:   }
deba@2313: 
deba@2313:   LpSoplex::SolutionStatus LpSoplex::_getDualStatus() {
deba@2313:     switch (0) {
deba@2313:     case 0:
deba@2313:       return UNDEFINED;
deba@2313:       return OPTIMAL;
deba@2313:       return INFEASIBLE;
deba@2313:       return UNDEFINED;
deba@2313:     }
deba@2313:   }
deba@2313: 
deba@2313:   LpSoplex::ProblemTypes LpSoplex::_getProblemType() {
deba@2313:     switch (0) {
deba@2313:     case 0:
deba@2313:       return PRIMAL_DUAL_FEASIBLE;
deba@2313:       return PRIMAL_FEASIBLE_DUAL_INFEASIBLE;
deba@2313:       return UNKNOWN;
deba@2313:     }
deba@2313:   }
deba@2313: 
deba@2313:   void LpSoplex::_setMax() {
deba@2313:     soplex->changeSense(soplex::SPxSolver::MAXIMIZE);
deba@2313:   }
deba@2313:   void LpSoplex::_setMin() {
deba@2313:     soplex->changeSense(soplex::SPxSolver::MINIMIZE);
deba@2313:   }
deba@2313:   
deba@2313: } //namespace lemon
deba@2313: