Changeset 631:33c6b6e755cd in lemon for lemon/lp_base.h
- Timestamp:
- 04/15/09 02:04:37 (16 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
-
lemon/lp_base.h (modified) (8 diffs)
Legend:
- Unmodified
- Added
- Removed
-
lemon/lp_base.h
r623 r631 53 53 ///Possible outcomes of an LP solving procedure 54 54 enum SolveExitStatus { 55 /// Thismeans that the problem has been successfully solved: either55 /// = 0. It means that the problem has been successfully solved: either 56 56 ///an optimal solution has been found or infeasibility/unboundedness 57 57 ///has been proved. 58 58 SOLVED = 0, 59 /// Any other case (including the case when some user specified60 ///limit has been exceeded) 59 /// = 1. Any other case (including the case when some user specified 60 ///limit has been exceeded). 61 61 UNSOLVED = 1 62 62 }; … … 72 72 ///Enum for \c messageLevel() parameter 73 73 enum MessageLevel { 74 /// no output (default value)74 /// No output (default value). 75 75 MESSAGE_NOTHING, 76 /// error messages only76 /// Error messages only. 77 77 MESSAGE_ERROR, 78 /// warnings78 /// Warnings. 79 79 MESSAGE_WARNING, 80 /// normal output80 /// Normal output. 81 81 MESSAGE_NORMAL, 82 /// verbose output82 /// Verbose output. 83 83 MESSAGE_VERBOSE 84 84 }; … … 1006 1006 const char* solverName() const {return _solverName();} 1007 1007 1008 ///\name Build up and modify the LP1008 ///\name Build Up and Modify the LP 1009 1009 1010 1010 ///@{ … … 1789 1789 /// The problem types for primal and dual problems 1790 1790 enum ProblemType { 1791 /// Feasible solution hasn't been found (but may exist).1791 /// = 0. Feasible solution hasn't been found (but may exist). 1792 1792 UNDEFINED = 0, 1793 /// The problem has no feasible solution1793 /// = 1. The problem has no feasible solution. 1794 1794 INFEASIBLE = 1, 1795 /// Feasible solution found1795 /// = 2. Feasible solution found. 1796 1796 FEASIBLE = 2, 1797 /// Optimal solution exists and found1797 /// = 3. Optimal solution exists and found. 1798 1798 OPTIMAL = 3, 1799 /// The cost function is unbounded1799 /// = 4. The cost function is unbounded. 1800 1800 UNBOUNDED = 4 1801 1801 }; … … 1853 1853 ///@} 1854 1854 1855 ///\name Obtain the solution1855 ///\name Obtain the Solution 1856 1856 1857 1857 ///@{ … … 1975 1975 /// The problem types for MIP problems 1976 1976 enum ProblemType { 1977 /// Feasible solution hasn't been found (but may exist).1977 /// = 0. Feasible solution hasn't been found (but may exist). 1978 1978 UNDEFINED = 0, 1979 /// The problem has no feasible solution1979 /// = 1. The problem has no feasible solution. 1980 1980 INFEASIBLE = 1, 1981 /// Feasible solution found1981 /// = 2. Feasible solution found. 1982 1982 FEASIBLE = 2, 1983 /// Optimal solution exists and found1983 /// = 3. Optimal solution exists and found. 1984 1984 OPTIMAL = 3, 1985 ///The cost function is unbounded 1986 /// 1987 ///The Mip or at least the relaxed problem is unbounded 1985 /// = 4. The cost function is unbounded. 1986 ///The Mip or at least the relaxed problem is unbounded. 1988 1987 UNBOUNDED = 4 1989 1988 }; … … 2007 2006 ///@} 2008 2007 2009 ///\name Set ting column type2008 ///\name Set Column Type 2010 2009 ///@{ 2011 2010 2012 2011 ///Possible variable (column) types (e.g. real, integer, binary etc.) 2013 2012 enum ColTypes { 2014 /// Continuous variable (default)2013 /// = 0. Continuous variable (default). 2015 2014 REAL = 0, 2016 /// Integer variable2015 /// = 1. Integer variable. 2017 2016 INTEGER = 1 2018 2017 }; … … 2035 2034 ///@} 2036 2035 2037 ///\name Obtain the solution2036 ///\name Obtain the Solution 2038 2037 2039 2038 ///@{
Note: See TracChangeset
for help on using the changeset viewer.
