Home
last modified time | relevance | path

Searched refs:optimalValue (Results 1 – 25 of 43) sorted by relevance

12

/dports/math/coinmp/CoinMP-releases-1.8.4/CoinMP/examples/
H A Dexample.c78 if (optimalValue != 0.0) { in GetAndCheckSolution()
119 GetAndCheckSolution(optimalValue, hProb); in RunTestProblem()
158 GetAndCheckSolution(optimalValue, hProb); in RunTestProblemBuf()
254 double optimalValue = 1428729.2857143; in SolveProblemCoinTest() local
291 double optimalValue = 506.66666667; in SolveProblemBakery() local
367 double optimalValue = -464.753142857; in SolveProblemAfiro() local
444 double optimalValue = 3089.0; in SolveProblemP0033() local
487 double optimalValue = 3.23684210526; in SolveProblemExmip1() local
529 double optimalValue = 0.72; in SolveProblemGamsSos1a() local
572 double optimalValue = 0.0; in SolveProblemGamsSos2a() local
[all …]
/dports/math/coinmp/CoinMP-releases-1.8.4/CoinMP/test/
H A DunitTest.cpp82 if (optimalValue != 0.0) { in GetAndCheckSolution()
124 GetAndCheckSolution(optimalValue, hProb); in RunTestProblem()
164 GetAndCheckSolution(optimalValue, hProb); in RunTestProblemBuf()
261 double optimalValue = 1428729.2857143; in SolveProblemCoinTest() local
298 double optimalValue = 506.66666667; in SolveProblemBakery() local
365 double optimalValue = -464.753142857; in SolveProblemAfiro() local
434 double optimalValue = 3089.0; in SolveProblemP0033() local
473 double optimalValue = 3.23684210526; in SolveProblemExmip1() local
515 double optimalValue = 0.72; in SolveProblemGamsSos1a() local
558 double optimalValue = 0.0; in SolveProblemGamsSos2a() local
[all …]
/dports/math/openturns/openturns-1.18/lib/src/Uncertainty/Algorithm/WeightedExperiments/
H A DSimulatedAnnealingLHS.cxx110 Scalar optimalValue(spaceFilling_.evaluate(standardOptimalDesign)); in generateWithRestart() local
126 …const Scalar newCriterion = spaceFilling_.perturbLHS(standardOptimalDesign, optimalValue, row1, ro… in generateWithRestart()
130 criteriaDifference = std::min(std::exp((optimalValue - newCriterion) / T), 1.0); in generateWithRestart()
132 criteriaDifference = std::min(std::exp((newCriterion - optimalValue) / T), 1.0); in generateWithRestart()
134 …if ((optimalValue >= newCriterion && spaceFilling_.isMinimizationProblem()) || (optimalValue < new… in generateWithRestart()
137 optimalValue = newCriterion; in generateWithRestart()
144 optimalValue = newCriterion; in generateWithRestart()
147 LOGDEBUG(OSS() << "Current optimal value =" << optimalValue); in generateWithRestart()
149 historyElement[0] = optimalValue; in generateWithRestart()
159 …result.add(transformation_(standardOptimalDesign), optimalValue, SpaceFillingC2().evaluate(standar… in generateWithRestart()
H A DMonteCarloLHS.cxx68 …Scalar optimalValue = spaceFilling_.isMinimizationProblem() ? SpecFunc::MaxScalar : SpecFunc::Lowe… in generateWithWeights() local
75 if (spaceFilling_.isMinimizationProblem() && (value < optimalValue)) in generateWithWeights()
78 optimalValue = value; in generateWithWeights()
80 if (!spaceFilling_.isMinimizationProblem() && (value > optimalValue)) in generateWithWeights()
83 optimalValue = value; in generateWithWeights()
86 …result.add(transformation_(optimalStandardDesign), optimalValue, SpaceFillingC2().evaluate(optimal… in generateWithWeights()
/dports/math/coinmp/CoinMP-releases-1.8.4/CoinMP/examples/csharp/
H A DSolveProblem.cs49 public void GetAndCheckSolution(double optimalValue, IntPtr hProb) in GetAndCheckSolution() argument
61 logTxt.WriteLine("Optimal Value: " + objectValue + " (" + optimalValue + ")"); in GetAndCheckSolution()
80 if (optimalValue != 0.0) { in GetAndCheckSolution()
81 if (Math.Abs(objectValue - optimalValue) >= 0.001) { in GetAndCheckSolution()
87 public void RunProblem(string problemName, double optimalValue, in RunProblem() argument
97 logTxt.WriteLine("Solve Problem: " + problemName + " (obj=" + optimalValue + ")"); in RunProblem()
126 GetAndCheckSolution(optimalValue, hProb); in RunProblem()
132 public void RunProblem(string problemName, double optimalValue, in RunProblem() argument
141 RunProblem(problemName, optimalValue, colCount, rowCount, in RunProblem()
149 public void RunProblemMip(string problemName, double optimalValue, in RunProblemMip() argument
[all …]
H A DProblemCoinTest.cs56 double optimalValue = 1428729.2857143; in Solve()
58 solveProblem.RunProblem(problemName, optimalValue, colCount, rowCount, in Solve()
H A DProblemBakery.cs40 double optimalValue = 506.66666667; in Solve()
42 solveProblem.RunProblem(problemName, optimalValue, colCount, rowCount, in Solve()
H A DProblemP0033.cs74 double optimalValue = 3089.0; in Solve()
76 solveProblem.RunProblem(probname, optimalValue, ncol, nrow, nels, nrng, in Solve()
H A DProblemExMip1.cs50 double optimalValue = 3.23684210526; in Solve()
52 solveProblem.RunProblem(probname, optimalValue, ncol, nrow, nels, nrng, in Solve()
H A DProblemsSemiCont.cs45 double optimalValue = 1.1; in Solve()
47 solveProblem.RunProblemMip(probname, optimalValue, ncol, nrow, nels, nrng, in Solve()
H A DProblemGamsSos1a.cs53 double optimalValue = 0.72; in Solve()
55 solveProblem.RunProblemMip(probname, optimalValue, ncol, nrow, nels, nrng, in Solve()
H A DProblemGamsSos2a.cs50 double optimalValue = 0.0; in Solve()
52 solveProblem.RunProblemMip(probname, optimalValue, ncol, nrow, nels, nrng, in Solve()
H A DProblemAfiro.cs71 double optimalValue = -464.753142857; in Solve()
73 … solveProblem.RunProblem(probname, optimalValue, ncol, nrow, nels, nrng, objsens, objconst, in Solve()
/dports/math/openturns/openturns-1.18/lib/test/
H A Dt_Dlib_std.expout10 -- optimalValue = [1.54578e-05]
20 -- optimalValue = [9.7466e-05]
30 -- optimalValue = [0.0853605]
43 -- optimalValue = [1.54578e-05]
53 -- optimalValue = [9.7466e-05]
63 -- optimalValue = [0.0853605]
96 -- optimalValue = [0.0853605]
129 -- optimalValue = [0.0853605]
142 -- optimalValue = [0.0206061]
157 -- optimalValue = [1.59451]
[all …]
H A Dt_Dlib_global.expout9 -- optimalValue = [0.122688]
14 -- optimalValue = [0.0853612]
/dports/math/frobby/frobby-0.9.1/src/
H A DOptimizeAction.cpp153 mpz_class optimalValue = 0; in perform() local
159 (v, optimalValue, displayAll); in perform()
162 (v, optimalValue, displayAll); in perform()
171 optimalValue = -optimalValue; in perform()
174 optimalValue -= subtract; in perform()
175 gmp_fprintf(stdout, "%Zd\n", optimalValue.get_mpz_t()); in perform()
H A DSliceFacade.cpp338 mpz_class& optimalValue, in solveIrreducibleDecompositionProgram() argument
348 return solveProgram(grading, optimalValue, reportAllSolutions); in solveIrreducibleDecompositionProgram()
353 mpz_class& optimalValue, in solveStandardProgram() argument
359 return solveProgram(grading, optimalValue, reportAllSolutions); in solveStandardProgram()
376 mpz_class& optimalValue, in solveProgram() argument
424 optimalValue = strategy.getMaximalValue(); in solveProgram()
H A DSliceFacade.h205 mpz_class& optimalValue,
212 mpz_class& optimalValue,
/dports/math/openturns/openturns-1.18/lib/src/Uncertainty/Algorithm/Optimization/
H A DEfficientGlobalOptimization.cxx73 ExpectedImprovementEvaluation (const Scalar optimalValue, in ExpectedImprovementEvaluation() argument
77 , optimalValue_(optimalValue) in ExpectedImprovementEvaluation()
175 Scalar optimalValuePrev = optimalValue;// previous optimal value in run()
183 optimalValuePrev = optimalValue; in run()
186 optimalValue = outputSample(index, 0); in run()
236 Scalar optimalValueSubstitute = optimalValue; in run()
317 if ((problem.isMinimization() && (newValue[0] < optimalValue)) in run()
318 || (!problem.isMinimization() && (newValue[0] > optimalValue))) in run()
321 optimalValuePrev = optimalValue; in run()
324 optimalValue = newValue[0]; in run()
[all …]
/dports/math/polymake/polymake-4.5/external/TOSimplex/include/TOSimplex/
H A DTOExMipSol.h262 optimalValue = T( 0 ); in BnB()
277 if( !allSolutions && optimalAssignment.size() && bs->bound >= optimalValue ){ in BnB()
324 std::cout << " (current best: " << optimalValue << ")"; in BnB()
366 … if( plex.opt() || ( !allSolutions && optimalAssignment.size() && plex.getObj() > optimalValue ) ){ in BnB()
408 if( !allSolutions && optimalAssignment.size() && objval >= optimalValue ){ in BnB()
440 if( optimalAssignment.size() == 0 || optimalValue > objval ){ in BnB()
441 optimalValue = objval; in BnB()
443 plex.setInfeasibilityBound( optimalValue ); in BnB()
475 optimalValue = - optimalValue; in BnB()
478 std::cout << "Solution: " << TOmath<T>::toShortString( optimalValue ) << std::endl; in BnB()
[all …]
/dports/math/coinmp/CoinMP-releases-1.8.4/CoinMP/examples/vb6/
H A DSolveBakery.bas47 Dim optimalValue As Double variable
112 optimalValue = 506.66666667
114 RunTestProblem problemName, optimalValue, colCount, rowCount, _
H A DRunProblem.bas12 Public Sub RunTestProblem(ByVal problemName As String, ByVal optimalValue As Double, _
39 LogWriteLine "Solve Problem: " & problemName & " (" & optimalValue & ")"
77 LogWriteLine "Optimal Value: " & objectValue & " (" & optimalValue & ")"
H A DSolveCoinTest.bas56 Dim optimalValue As Double variable
191 optimalValue = 1428729.2857143
193 RunTestProblem problemName, optimalValue, colCount, rowCount, _
H A DSolveExMip1.bas46 Dim optimalValue As Double variable
197 optimalValue = 3.23684210526
199 RunTestProblem problemName, optimalValue, colCount, rowCount, _
/dports/math/z3/z3-z3-4.8.13/examples/msf/SolverFoundation.Plugin.Z3/
H A DZ3BaseSolver.cs335 var optimalValue = Utils.ToRational(pair.Value.Upper); in Solve()
336 _model.SetValue(pair.Key.Index, optimalValue); in Solve()
359 var optimalValue = Utils.ToRational(pair.Value.Upper); in Solve()
360 _model.SetValue(pair.Key.Index, optimalValue); in Solve()

12