Home
last modified time | relevance | path

Searched refs:nCallOptimizeTNLP_ (Results 1 – 4 of 4) sorted by relevance

/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/interfaces/
H A DCouenneMINLPInterface.cpp346 nCallOptimizeTNLP_(0),
499 nCallOptimizeTNLP_(0),
591 nCallOptimizeTNLP_ = rhs.nCallOptimizeTNLP_;
592 totalNlpSolveTime_ = rhs.nCallOptimizeTNLP_;
670 nCallOptimizeTNLP_ = rhs.nCallOptimizeTNLP_;
2110 nCallOptimizeTNLP_++;
2135 nCallOptimizeTNLP_++;
2384 nCallOptimizeTNLP_++;
2557 if((nCallOptimizeTNLP_ % 20) == 1)
2568 os<<"_"<<nCallOptimizeTNLP_;
[all …]
H A DCouenneMINLPInterface.hpp486 return nCallOptimizeTNLP_;
1177 int nCallOptimizeTNLP_;
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Interfaces/
H A DBonOsiTMINLPInterface.cpp385 nCallOptimizeTNLP_(0), in OsiTMINLPInterface()
548 nCallOptimizeTNLP_(0), in OsiTMINLPInterface()
642 nCallOptimizeTNLP_ = rhs.nCallOptimizeTNLP_; in operator =()
643 totalNlpSolveTime_ = rhs.nCallOptimizeTNLP_; in operator =()
723 nCallOptimizeTNLP_ = rhs.nCallOptimizeTNLP_; in operator =()
2329 nCallOptimizeTNLP_++; in solveFeasibilityProblem()
2354 nCallOptimizeTNLP_++; in solveFeasibilityProblem()
2618 nCallOptimizeTNLP_++; in solveAndCheckErrors()
2750 if((nCallOptimizeTNLP_ % 20) == 1) in solveAndCheckErrors()
2761 os<<"_"<<nCallOptimizeTNLP_; in solveAndCheckErrors()
[all …]
H A DBonOsiTMINLPInterface.hpp484 return nCallOptimizeTNLP_; in nCallOptimizeTNLP()
1187 int nCallOptimizeTNLP_; member in Bonmin::OsiTMINLPInterface