Changes in lemon/lp_base.h [540:9db62975c32b:584:33c6b6e755cd] in lemon-main
- File:
-
- 1 edited
-
lemon/lp_base.h (modified) (10 diffs)
Legend:
- Unmodified
- Added
- Removed
-
lemon/lp_base.h
r540 r584 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 }; … … 69 69 MAX 70 70 }; 71 72 ///Enum for \c messageLevel() parameter 73 enum MessageLevel { 74 /// No output (default value). 75 MESSAGE_NOTHING, 76 /// Error messages only. 77 MESSAGE_ERROR, 78 /// Warnings. 79 MESSAGE_WARNING, 80 /// Normal output. 81 MESSAGE_NORMAL, 82 /// Verbose output. 83 MESSAGE_VERBOSE 84 }; 85 71 86 72 87 ///The floating point type used by the solver … … 974 989 virtual const char* _solverName() const = 0; 975 990 991 virtual void _messageLevel(MessageLevel level) = 0; 992 976 993 //Own protected stuff 977 994 … … 989 1006 const char* solverName() const {return _solverName();} 990 1007 991 ///\name Build up and modify the LP1008 ///\name Build Up and Modify the LP 992 1009 993 1010 ///@{ … … 1528 1545 void clear() { _clear(); } 1529 1546 1547 /// Sets the message level of the solver 1548 void messageLevel(MessageLevel level) { _messageLevel(level); } 1549 1530 1550 ///@} 1531 1551 … … 1769 1789 /// The problem types for primal and dual problems 1770 1790 enum ProblemType { 1771 /// Feasible solution hasn't been found (but may exist).1791 /// = 0. Feasible solution hasn't been found (but may exist). 1772 1792 UNDEFINED = 0, 1773 /// The problem has no feasible solution1793 /// = 1. The problem has no feasible solution. 1774 1794 INFEASIBLE = 1, 1775 /// Feasible solution found1795 /// = 2. Feasible solution found. 1776 1796 FEASIBLE = 2, 1777 /// Optimal solution exists and found1797 /// = 3. Optimal solution exists and found. 1778 1798 OPTIMAL = 3, 1779 /// The cost function is unbounded1799 /// = 4. The cost function is unbounded. 1780 1800 UNBOUNDED = 4 1781 1801 }; … … 1833 1853 ///@} 1834 1854 1835 ///\name Obtain the solution1855 ///\name Obtain the Solution 1836 1856 1837 1857 ///@{ … … 1955 1975 /// The problem types for MIP problems 1956 1976 enum ProblemType { 1957 /// Feasible solution hasn't been found (but may exist).1977 /// = 0. Feasible solution hasn't been found (but may exist). 1958 1978 UNDEFINED = 0, 1959 /// The problem has no feasible solution1979 /// = 1. The problem has no feasible solution. 1960 1980 INFEASIBLE = 1, 1961 /// Feasible solution found1981 /// = 2. Feasible solution found. 1962 1982 FEASIBLE = 2, 1963 /// Optimal solution exists and found1983 /// = 3. Optimal solution exists and found. 1964 1984 OPTIMAL = 3, 1965 ///The cost function is unbounded 1966 /// 1967 ///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. 1968 1987 UNBOUNDED = 4 1969 1988 }; … … 1987 2006 ///@} 1988 2007 1989 ///\name Set ting column type2008 ///\name Set Column Type 1990 2009 ///@{ 1991 2010 1992 2011 ///Possible variable (column) types (e.g. real, integer, binary etc.) 1993 2012 enum ColTypes { 1994 /// Continuous variable (default)2013 /// = 0. Continuous variable (default). 1995 2014 REAL = 0, 1996 /// Integer variable2015 /// = 1. Integer variable. 1997 2016 INTEGER = 1 1998 2017 }; … … 2015 2034 ///@} 2016 2035 2017 ///\name Obtain the solution2036 ///\name Obtain the Solution 2018 2037 2019 2038 ///@{
Note: See TracChangeset
for help on using the changeset viewer.
