athos@1261: /* -*- C++ -*-
athos@1261:  *
alpar@1956:  * This file is a part of LEMON, a generic C++ optimization library
alpar@1956:  *
alpar@2391:  * Copyright (C) 2003-2007
alpar@1956:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@1359:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
athos@1261:  *
athos@1261:  * Permission to use, modify and distribute this software is granted
athos@1261:  * provided that this copyright notice appears in all copies. For
athos@1261:  * precise terms see the accompanying LICENSE file.
athos@1261:  *
athos@1261:  * This software is provided "AS IS" with no warranty of any kind,
athos@1261:  * express or implied, and with no claim as to its suitability for any
athos@1261:  * purpose.
athos@1261:  *
athos@1261:  */
athos@1261: 
athos@1261: ///\file
athos@1261: ///\brief Implementation of the LEMON-GLPK lp solver interface.
athos@1261: 
ladanyi@1305: #include <lemon/lp_glpk.h>
athos@1473: //#include <iostream>
athos@1261: namespace lemon {
athos@1261: 
alpar@1364: 
deba@2363:   LpGlpk::LpGlpk() : Parent() {
deba@2363:     rows = _lp_bits::LpId(1);
deba@2363:     cols = _lp_bits::LpId(1);
deba@2363:     lp = lpx_create_prob();
deba@2368:     lpx_create_index(lp);
deba@2363:     ///\todo control function for this:
alpar@1321:     lpx_set_int_parm(lp, LPX_K_DUAL, 1);
alpar@1321:     messageLevel(0);
alpar@1321:   }
alpar@1321:   
deba@2363:   LpGlpk::LpGlpk(const LpGlpk &glp) : Parent() {
deba@2363:     rows = _lp_bits::LpId(1);
deba@2363:     cols = _lp_bits::LpId(1);
deba@2363:     lp = lpx_create_prob();
deba@2366:     lpx_create_index(lp);
deba@2363:     ///\todo control function for this:
alpar@2321:     lpx_set_int_parm(lp, LPX_K_DUAL, 1);
alpar@2321:     messageLevel(0);
alpar@2321:     //Coefficient matrix, row bounds
alpar@2321:     lpx_add_rows(lp, lpx_get_num_rows(glp.lp));
alpar@2321:     lpx_add_cols(lp, lpx_get_num_cols(glp.lp));
alpar@2321:     int len;
alpar@2321:     int ind[1+lpx_get_num_cols(glp.lp)];
alpar@2321:     Value val[1+lpx_get_num_cols(glp.lp)];
alpar@2321:     for (int i=1;i<=lpx_get_num_rows(glp.lp);++i)
alpar@2321:       {
alpar@2321: 	len=lpx_get_mat_row(glp.lp,i,ind,val);
alpar@2321: 	lpx_set_mat_row(lp, i,len,ind,val);
alpar@2321: 	lpx_set_row_bnds(lp,i,lpx_get_row_type(glp.lp,i),
alpar@2321: 			 lpx_get_row_lb(glp.lp,i),lpx_get_row_ub(glp.lp,i));
alpar@2321:       }
alpar@2321: 
alpar@2321:     //Objective function, coloumn bounds
alpar@2321:     lpx_set_obj_dir(lp, lpx_get_obj_dir(glp.lp));
alpar@2321:     //Objectif function's constant term treated separately
alpar@2321:     lpx_set_obj_coef(lp,0,lpx_get_obj_coef(glp.lp,0));
alpar@2321:     for (int i=1;i<=lpx_get_num_cols(glp.lp);++i)
alpar@2321:       {
alpar@2321: 	lpx_set_obj_coef(lp,i,lpx_get_obj_coef(glp.lp,i));
alpar@2321: 	lpx_set_col_bnds(lp,i,lpx_get_col_type(glp.lp,i),
alpar@2321: 			 lpx_get_col_lb(glp.lp,i),lpx_get_col_ub(glp.lp,i));
alpar@2321:       }
alpar@2321:   }
alpar@2321:   
alpar@1321:   LpGlpk::~LpGlpk() {
alpar@1321:     lpx_delete_prob(lp);
alpar@1321:   }
alpar@1321:   
alpar@1321:   int LpGlpk::_addCol() { 
alpar@1321:     int i=lpx_add_cols(lp, 1);
alpar@1321:     _setColLowerBound(i, -INF);
alpar@1321:     _setColUpperBound(i, INF);
alpar@1321:     return i;
alpar@1321:   }
alpar@1321: 
athos@1436:   ///\e
athos@1436: 
athos@1436: 
athos@1436:   LpSolverBase &LpGlpk::_newLp()
athos@1436:   {
alpar@2321:     LpGlpk* newlp=new LpGlpk;
athos@1436:     return *newlp;
athos@1436:   }
athos@1436:   
athos@1436:   ///\e
athos@1436: 
athos@1436:   LpSolverBase &LpGlpk::_copyLp()
athos@1436:   {
alpar@2321:     LpGlpk* newlp=new LpGlpk(*this);
athos@1436:     return *newlp;
athos@1436:   }
athos@1436: 
alpar@1321:   int LpGlpk::_addRow() { 
alpar@1321:     int i=lpx_add_rows(lp, 1);
alpar@1321:     return i;
alpar@1321:   }
alpar@1321: 
alpar@1321:   
athos@1432:   void LpGlpk::_eraseCol(int i) {
deba@2386:     int ca[2];
deba@2386:     ca[1]=i;
deba@2386:     lpx_del_cols(lp, 1, ca);
athos@1432:   }
athos@1432:   
athos@1432:   void LpGlpk::_eraseRow(int i) {
deba@2386:     int ra[2];
deba@2386:     ra[1]=i;
deba@2386:     lpx_del_rows(lp, 1, ra);
athos@1432:   }
athos@1432: 
deba@2386:   void LpGlpk::_getColName(int c, std::string & name) const
alpar@1895:   {
alpar@1895:     
deba@2386:     char *n = lpx_get_col_name(lp,c);
alpar@1895:     name = n?n:"";
alpar@1895:   }
alpar@1895:   
alpar@1895:   
deba@2386:   void LpGlpk::_setColName(int c, const std::string & name)
alpar@1895:   {
deba@2386:     lpx_set_col_name(lp,c,const_cast<char*>(name.c_str()));
athos@2349: 
alpar@1895:   }
deba@2366: 
deba@2366:   int LpGlpk::_colByName(const std::string& name) const
deba@2366:   {
deba@2366:     int k = lpx_find_col(lp, const_cast<char*>(name.c_str()));
deba@2366:     return k > 0 ? k : -1; 
deba@2366:   }
deba@2366: 
alpar@1895:   
deba@2364:   void LpGlpk::_setRowCoeffs(int i, ConstRowIterator b, ConstRowIterator e) 
alpar@1321:   {
deba@2312:     std::vector<int> indices;
deba@2312:     std::vector<Value> values;
deba@2312: 
deba@2312:     indices.push_back(0);
deba@2312:     values.push_back(0);
deba@2312: 
deba@2364:     for(ConstRowIterator it=b; it!=e; ++it) {
deba@2312:       indices.push_back(it->first);
deba@2312:       values.push_back(it->second);
deba@2312:     }
deba@2312: 
deba@2312:     lpx_set_mat_row(lp, i, values.size() - 1, &indices[0], &values[0]);
alpar@1321:   }
deba@2364: 
deba@2386:   void LpGlpk::_getRowCoeffs(int ix, RowIterator b) const
deba@2364:   {
deba@2386:     int length = lpx_get_mat_row(lp, ix, 0, 0);
deba@2364:     
deba@2364:     std::vector<int> indices(length + 1);
deba@2364:     std::vector<Value> values(length + 1);
deba@2364:     
deba@2386:     lpx_get_mat_row(lp, ix, &indices[0], &values[0]);
deba@2364:     
deba@2364:     for (int i = 1; i <= length; ++i) {
deba@2364:       *b = std::make_pair(indices[i], values[i]);
deba@2364:       ++b;
deba@2364:     }
deba@2364:   }
alpar@1321:   
deba@2386:   void LpGlpk::_setColCoeffs(int ix, ConstColIterator b, ConstColIterator e) {
deba@2312: 
deba@2312:     std::vector<int> indices;
deba@2312:     std::vector<Value> values;
deba@2312: 
deba@2312:     indices.push_back(0);
deba@2312:     values.push_back(0);
deba@2312: 
deba@2364:     for(ConstColIterator it=b; it!=e; ++it) {
deba@2312:       indices.push_back(it->first);
deba@2312:       values.push_back(it->second);
deba@2312:     }
deba@2312:     
deba@2386:     lpx_set_mat_col(lp, ix, values.size() - 1, &indices[0], &values[0]);
alpar@1321:   }
athos@1431: 
deba@2386:   void LpGlpk::_getColCoeffs(int ix, ColIterator b) const
deba@2364:   {
deba@2386:     int length = lpx_get_mat_col(lp, ix, 0, 0);
deba@2364:     
deba@2364:     std::vector<int> indices(length + 1);
deba@2364:     std::vector<Value> values(length + 1);
deba@2364:     
deba@2386:     lpx_get_mat_col(lp, ix, &indices[0], &values[0]);
deba@2364:     
deba@2364:     for (int i = 1; i <= length; ++i) {
deba@2364:       *b = std::make_pair(indices[i], values[i]);
deba@2364:       ++b;
deba@2364:     }
deba@2364:   }
athos@1431: 
deba@2386:   void LpGlpk::_setCoeff(int ix, int jx, Value value) 
athos@1431:   {
deba@2312: 
deba@2312:     if (lpx_get_num_cols(lp) < lpx_get_num_rows(lp)) {
deba@2312: 
deba@2386:       int length=lpx_get_mat_row(lp, ix, 0, 0);
deba@2312:       
deba@2312:       std::vector<int> indices(length + 2);
deba@2312:       std::vector<Value> values(length + 2);
deba@2312:       
deba@2386:       lpx_get_mat_row(lp, ix, &indices[0], &values[0]);
deba@2312:       
deba@2312:       //The following code does not suppose that the elements of the
deba@2312:       //array indices are sorted
deba@2312:       bool found=false;
deba@2312:       for (int i = 1; i <= length; ++i) {
deba@2386:         if (indices[i]==jx){
deba@2312:           found=true;
deba@2312:           values[i]=value;
deba@2312:           break;
deba@2312:         }
deba@2312:       }
deba@2312:       if (!found){
deba@2312:         ++length;
deba@2386:         indices[length]=jx;
deba@2312:         values[length]=value;
deba@2312:       }
athos@1431:     
deba@2386:       lpx_set_mat_row(lp, ix, length, &indices[0], &values[0]);
deba@2312: 
deba@2312:     } else {
deba@2312: 
deba@2386:       int length=lpx_get_mat_col(lp, jx, 0, 0);
deba@2312:       
deba@2312:       std::vector<int> indices(length + 2);
deba@2312:       std::vector<Value> values(length + 2);
deba@2312:       
deba@2386:       lpx_get_mat_col(lp, jx, &indices[0], &values[0]);
deba@2312:       
deba@2312:       //The following code does not suppose that the elements of the
deba@2312:       //array indices are sorted
deba@2312:       bool found=false;
deba@2312:       for (int i = 1; i <= length; ++i) {
deba@2386:         if (indices[i]==jx){
deba@2312:           found=true;
deba@2312:           values[i]=value;
deba@2312:           break;
deba@2312:         }
deba@2312:       }
deba@2312:       if (!found){
deba@2312:         ++length;
deba@2386:         indices[length]=ix;
deba@2312:         values[length]=value;
deba@2312:       }
athos@1431:     
deba@2386:       lpx_set_mat_col(lp, jx, length, &indices[0], &values[0]);
athos@1431:     }
athos@1431:   }
athos@1431: 
deba@2386:   LpGlpk::Value LpGlpk::_getCoeff(int ix, int jx) const
athos@2324:   {
athos@2328: 
deba@2386:     int length=lpx_get_mat_row(lp, ix, 0, 0);
athos@2328:     
deba@2364:     std::vector<int> indices(length + 1);
deba@2364:     std::vector<Value> values(length + 1);
athos@2328:     
deba@2386:     lpx_get_mat_row(lp, ix, &indices[0], &values[0]);
athos@2328:     
athos@2328:     //The following code does not suppose that the elements of the
athos@2328:     //array indices are sorted
athos@2328:     for (int i = 1; i <= length; ++i) {
deba@2386:       if (indices[i]==jx){
athos@2328: 	return values[i];
athos@2328:       }
athos@2328:     }
athos@2324:     return 0;
athos@2328: 
athos@2324:   }
athos@2324: 
athos@2324: 
alpar@1321:   void LpGlpk::_setColLowerBound(int i, Value lo)
alpar@1321:   {
alpar@1321:     if (lo==INF) {
alpar@1321:       //FIXME error
alpar@1321:     }
alpar@1321:     int b=lpx_get_col_type(lp, i);
alpar@1321:     double up=lpx_get_col_ub(lp, i);	
alpar@1321:     if (lo==-INF) {
alpar@1321:       switch (b) {
alpar@1321:       case LPX_FR:
alpar@1321:       case LPX_LO:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_FR, lo, up);
alpar@1321: 	break;
alpar@1321:       case LPX_UP:
alpar@1321: 	break;
alpar@1321:       case LPX_DB:
alpar@1321:       case LPX_FX:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
alpar@1321: 	break;
alpar@1321:       default: ;
alpar@1321: 	//FIXME error
alpar@1321:       }
alpar@1321:     } else {
alpar@1321:       switch (b) {
alpar@1321:       case LPX_FR:
alpar@1321:       case LPX_LO:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_LO, lo, up);
alpar@1321: 	break;
alpar@1321:       case LPX_UP:	  
alpar@1321:       case LPX_DB:
alpar@1321:       case LPX_FX:
alpar@1321: 	if (lo==up) 
alpar@1321: 	  lpx_set_col_bnds(lp, i, LPX_FX, lo, up);
alpar@1321: 	else 
alpar@1321: 	  lpx_set_col_bnds(lp, i, LPX_DB, lo, up);
alpar@1321: 	break;
alpar@1321:       default: ;
alpar@1321: 	//FIXME error
alpar@1321:       }
athos@1261:     }
athos@1261: 
alpar@1321:   }
athos@2328: 
deba@2366:   LpGlpk::Value LpGlpk::_getColLowerBound(int i) const
athos@2328:   {
athos@2328:     int b=lpx_get_col_type(lp, i);
athos@2328:       switch (b) {
athos@2328:       case LPX_LO:
athos@2328:       case LPX_DB:
athos@2328:       case LPX_FX:
athos@2328: 	return lpx_get_col_lb(lp, i);	
athos@2328:       default: ;
athos@2328: 	return -INF;
athos@2328:       }
athos@2328:   }
alpar@1321:   
alpar@1321:   void LpGlpk::_setColUpperBound(int i, Value up)
alpar@1321:   {
alpar@1321:     if (up==-INF) {
alpar@1321:       //FIXME error
athos@1261:     }
alpar@1321:     int b=lpx_get_col_type(lp, i);
alpar@1321:     double lo=lpx_get_col_lb(lp, i);
alpar@1321:     if (up==INF) {
alpar@1321:       switch (b) {
alpar@1321:       case LPX_FR:
alpar@1321:       case LPX_LO:
alpar@1321: 	break;
alpar@1321:       case LPX_UP:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_FR, lo, up);
alpar@1321: 	break;
alpar@1321:       case LPX_DB:
alpar@1321:       case LPX_FX:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_LO, lo, up);
alpar@1321: 	break;
alpar@1321:       default: ;
athos@1261: 	//FIXME error
athos@1261:       }
alpar@1321:     } else {
alpar@1321:       switch (b) {
alpar@1321:       case LPX_FR:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
alpar@1321: 	break;
alpar@1321:       case LPX_UP:
alpar@1321: 	lpx_set_col_bnds(lp, i, LPX_UP, lo, up);
alpar@1321: 	break;
alpar@1321:       case LPX_LO:
alpar@1321:       case LPX_DB:
alpar@1321:       case LPX_FX:
alpar@1321: 	if (lo==up) 
alpar@1321: 	  lpx_set_col_bnds(lp, i, LPX_FX, lo, up);
alpar@1321: 	else 
alpar@1321: 	  lpx_set_col_bnds(lp, i, LPX_DB, lo, up);
alpar@1321: 	break;
alpar@1321:       default: ;
athos@1261: 	//FIXME error
athos@1261:       }
alpar@1321:     }
alpar@1321:   }
athos@2328: 
deba@2366:   LpGlpk::Value LpGlpk::_getColUpperBound(int i) const
athos@2328:   {
athos@2328:     int b=lpx_get_col_type(lp, i);
athos@2328:       switch (b) {
athos@2328:       case LPX_UP:
athos@2328:       case LPX_DB:
athos@2328:       case LPX_FX:
athos@2328: 	return lpx_get_col_ub(lp, i);	
athos@2328:       default: ;
athos@2328: 	return INF;
athos@2328:       }
athos@2328:   }
alpar@1321:   
athos@1379:   void LpGlpk::_setRowBounds(int i, Value lb, Value ub)
athos@1379:   {
athos@1379:     //Bad parameter
athos@1379:     if (lb==INF || ub==-INF) {
athos@1379:       //FIXME error
athos@1379:     }
athos@1379: 
athos@1379:     if (lb == -INF){
athos@1379:       if (ub == INF){
athos@1379: 	lpx_set_row_bnds(lp, i, LPX_FR, lb, ub);
athos@1379:       }
athos@1379:       else{
athos@1379: 	lpx_set_row_bnds(lp, i, LPX_UP, lb, ub);
athos@1379:       }
athos@1379:     }
athos@1379:     else{
athos@1379:       if (ub==INF){
athos@1379: 	lpx_set_row_bnds(lp, i, LPX_LO, lb, ub);
athos@1379: 
athos@1379:       }
athos@1379:       else{
athos@1379: 	if (lb == ub){
athos@1379: 	  lpx_set_row_bnds(lp, i, LPX_FX, lb, ub);
athos@1379: 	}
athos@1379: 	else{
athos@1379: 	  lpx_set_row_bnds(lp, i, LPX_DB, lb, ub);
athos@1379: 	}
athos@1379:       }
athos@1379:     }
athos@1379: 
athos@1379:   }
athos@2328: 
deba@2366:   void LpGlpk::_getRowBounds(int i, Value &lb, Value &ub) const
athos@2328:   {
athos@2328: 
athos@2328:     int b=lpx_get_row_type(lp, i);
athos@2328:     switch (b) {
athos@2328:     case LPX_FR:
athos@2328:     case LPX_UP:
athos@2328:       lb = -INF;
athos@2328: 	break;
athos@2328:     default: 
athos@2328:       lb=lpx_get_row_lb(lp, i);
athos@2328:     }
athos@2328: 
athos@2328:     switch (b) {
athos@2328:     case LPX_FR:
athos@2328:     case LPX_LO:
athos@2328:       ub = INF;
athos@2328: 	break;
athos@2328:     default: 
athos@2328:       ub=lpx_get_row_ub(lp, i);
athos@2328:     }
athos@2328:     
athos@2328:   }
athos@1261:   
athos@1298:   void LpGlpk::_setObjCoeff(int i, Value obj_coef)
athos@1298:   {
athos@1376:     //i=0 means the constant term (shift)
athos@1298:     lpx_set_obj_coef(lp, i, obj_coef);
athos@1298:   }
athos@1261: 
deba@2366:   LpGlpk::Value LpGlpk::_getObjCoeff(int i) const {
athos@2324:     //i=0 means the constant term (shift)
athos@2324:     return lpx_get_obj_coef(lp, i);
athos@2324:   }
athos@2324: 
athos@1377:   void LpGlpk::_clearObj()
athos@1376:   {
athos@1377:     for (int i=0;i<=lpx_get_num_cols(lp);++i){
athos@1377:       lpx_set_obj_coef(lp, i, 0);
athos@1376:     }
athos@1376:   }
alpar@1263: 
alpar@1303:   LpGlpk::SolveExitStatus LpGlpk::_solve()
alpar@1263:   {
athos@2345:     // A way to check the problem to be solved
athos@2345:     //lpx_write_cpxlp(lp,"naittvan.cpx");    
athos@2345: 
deba@2363:     lpx_std_basis(lp);
athos@1458:     int i =  lpx_simplex(lp);
deba@2363:     
athos@1298:     switch (i) {
athos@1298:     case LPX_E_OK: 
athos@1298:       return SOLVED;
athos@1298:     default:
athos@1298:       return UNSOLVED;
athos@1298:     }
alpar@1263:   }
alpar@1263: 
deba@2366:   LpGlpk::Value LpGlpk::_getPrimal(int i) const
alpar@1263:   {
athos@1298:     return lpx_get_col_prim(lp,i);
alpar@1263:   }
marci@1787: 
deba@2366:   LpGlpk::Value LpGlpk::_getDual(int i) const
marci@1787:   {
marci@1787:     return lpx_get_row_dual(lp,i);
marci@1787:   }
alpar@1263:   
deba@2366:   LpGlpk::Value LpGlpk::_getPrimalValue() const
alpar@1312:   {
athos@1314:     return lpx_get_obj_val(lp);
alpar@1312:   }
deba@2366:   bool LpGlpk::_isBasicCol(int i) const
deba@2366:   {
marci@1840:     return (lpx_get_col_stat(lp, i)==LPX_BS);
marci@1840:   }
alpar@1312:   
athos@1298:  
deba@2366:   LpGlpk::SolutionStatus LpGlpk::_getPrimalStatus() const
alpar@1294:   {
athos@1298:     int stat=  lpx_get_status(lp);
athos@1298:     switch (stat) {
athos@1298:     case LPX_UNDEF://Undefined (no solve has been run yet)
athos@1298:       return UNDEFINED;
athos@1458:     case LPX_NOFEAS://There is no feasible solution (primal, I guess)
athos@1458:     case LPX_INFEAS://Infeasible 
athos@1458:       return INFEASIBLE;
athos@1458:     case LPX_UNBND://Unbounded
athos@1458:       return INFINITE;
athos@1458:     case LPX_FEAS://Feasible
athos@1458:       return FEASIBLE;
athos@1458:     case LPX_OPT://Feasible
athos@1458:       return OPTIMAL;
athos@1458:     default:
athos@1458:       return UNDEFINED; //to avoid gcc warning
athos@1458:       //FIXME error
athos@1458:     }
athos@1458:   }
athos@1458: 
deba@2366:   LpGlpk::SolutionStatus LpGlpk::_getDualStatus() const
athos@1458:   {
alpar@1466:     switch (lpx_get_dual_stat(lp)) {
athos@1458:     case LPX_D_UNDEF://Undefined (no solve has been run yet)
athos@1458:       return UNDEFINED;
athos@1540:     case LPX_D_NOFEAS://There is no dual feasible solution 
athos@1460: //    case LPX_D_INFEAS://Infeasible 
athos@1458:       return INFEASIBLE;
athos@1473:     case LPX_D_FEAS://Feasible    
athos@1473:       switch (lpx_get_status(lp)) {
athos@1473:       case LPX_NOFEAS:
athos@1458: 	return INFINITE;
athos@1458:       case LPX_OPT:
athos@1458: 	return OPTIMAL;
athos@1458:       default:
athos@1458: 	return FEASIBLE;
athos@1458:       }
athos@1458:     default:
athos@1458:       return UNDEFINED; //to avoid gcc warning
athos@1458:       //FIXME error
athos@1458:     }
athos@1458:   }
athos@1458: 
deba@2366:   LpGlpk::ProblemTypes LpGlpk::_getProblemType() const
athos@1458:   {
athos@1460:       //int stat=  lpx_get_status(lp);
athos@1458:     int statp=  lpx_get_prim_stat(lp);
athos@1458:     int statd=  lpx_get_dual_stat(lp);
athos@1464:     if (statp==LPX_P_FEAS && statd==LPX_D_FEAS)
athos@1460: 	return PRIMAL_DUAL_FEASIBLE;
athos@1464:     if (statp==LPX_P_FEAS && statd==LPX_D_NOFEAS)
athos@1460: 	return PRIMAL_FEASIBLE_DUAL_INFEASIBLE;
athos@1464:     if (statp==LPX_P_NOFEAS && statd==LPX_D_FEAS)
athos@1460: 	return PRIMAL_INFEASIBLE_DUAL_FEASIBLE;
athos@1464:     if (statp==LPX_P_NOFEAS && statd==LPX_D_NOFEAS)
athos@1460: 	return PRIMAL_DUAL_INFEASIBLE;
athos@1460:     //In all other cases
athos@1460:     return UNKNOWN;
alpar@1294:   }
alpar@1263: 
alpar@1312:   void LpGlpk::_setMax()
alpar@1312:   {
alpar@1321:     lpx_set_obj_dir(lp, LPX_MAX);
alpar@1321:   }
alpar@1321: 
alpar@1312:   void LpGlpk::_setMin()
alpar@1312:   {
alpar@1321:     lpx_set_obj_dir(lp, LPX_MIN);
alpar@1321:   }
alpar@1321: 
deba@2366:   bool LpGlpk::_isMax() const
athos@2324:   {
athos@2324:     return (lpx_get_obj_dir(lp)==LPX_MAX);
athos@2324:   }
athos@2324: 
alpar@1321:  
athos@2324: 
alpar@1321:   void LpGlpk::messageLevel(int m)
alpar@1321:   {
alpar@1321:     lpx_set_int_parm(lp, LPX_K_MSGLEV, m);
alpar@1321:   }
alpar@1312: 
alpar@1326:   void LpGlpk::presolver(bool b)
alpar@1326:   {
alpar@1326:     lpx_set_int_parm(lp, LPX_K_PRESOL, b);
alpar@1326:   }
alpar@1326: 
alpar@1312:  
athos@1261: } //END OF NAMESPACE LEMON