Changeset 1312:48f9299b390d in lemon-0.x for src/lemon/lp_base.h
- Timestamp:
- 04/07/05 08:31:03 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1751
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/lp_base.h
r1305 r1312 393 393 virtual SolveExitStatus _solve() = 0; 394 394 virtual Value _getPrimal(int i) = 0; 395 virtual SolutionStatus _getPrimalType() = 0; 396 395 virtual Value _getPrimalValue() = 0; 396 virtual SolutionStatus _getPrimalStatus() = 0; 397 virtual void _setMax() = 0; 398 virtual void _setMin() = 0; 399 397 400 398 401 void clearObj() {} … … 428 431 ///like 429 432 ///\code 430 ///std::map<Any Type,LpSolverBase::Col>433 ///std::map<AnyStatus,LpSolverBase::Col> 431 434 ///\endcode 432 435 ///- an iterable lemon \ref concept::WriteMap "write map" like … … 607 610 } 608 611 612 ///Maximize 613 void max() { _setMax(); } 614 ///Minimize 615 void min() { _setMin(); } 616 617 609 618 ///@} 610 619 … … 624 633 625 634 ///\e 626 SolutionStatus primal Type() {627 return _getPrimal Type();635 SolutionStatus primalStatus() { 636 return _getPrimalStatus(); 628 637 } 629 638 … … 631 640 Value primal(Col c) { return _getPrimal(cols.floatingId(c.id)); } 632 641 642 ///\e 643 644 ///\return 645 ///- \ref INF or -\ref INF means either infeasibility or unboundedness 646 /// of the primal problem, depending on whether we minimize or maximize. 647 ///- \ref NAN if no primal solution is found. 648 ///- The (finite) objective value if an optimal solution is found. 649 Value primalValue() { return _getPrimalValue();} 633 650 ///@} 634 651
Note: See TracChangeset
for help on using the changeset viewer.