Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2994-AutoDiffForIntervals/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/BealeEvaluatorTest.cs @ 17563

Last change on this file since 17563 was 17209, checked in by gkronber, 5 years ago

#2994: merged r17132:17198 from trunk to branch

File size: 1.8 KB
RevLine 
[3781]1#region License Information
2/* HeuristicLab
[17209]3 * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[3781]4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
[4068]22using HeuristicLab.Encodings.RealVectorEncoding;
[3781]23using Microsoft.VisualStudio.TestTools.UnitTesting;
24
[9764]25namespace HeuristicLab.Problems.TestFunctions.Tests {
[4068]26  /// <summary>
27  ///This is a test class for BealeEvaluatorTest and is intended
28  ///to contain all BealeEvaluatorTest Unit Tests
29  ///</summary>
[3781]30  [TestClass()]
31  public class BealeEvaluatorTest {
32    /// <summary>
33    ///A test for EvaluateFunction
34    ///</summary>
[9775]35    [TestMethod]
[9782]36    [TestCategory("Problems.TestFunctions")]
37    [TestProperty("Time", "short")]
[3781]38    public void BealeEvaluateFunctionTest() {
[14354]39      BealeEvaluator target = new BealeEvaluator();
[3781]40      RealVector point = null;
[14354]41      double expected = target.BestKnownQuality;
[3781]42      double actual;
[14354]43      for (int dimension = target.MinimumProblemSize; dimension <= System.Math.Min(10, target.MaximumProblemSize); dimension++) {
44        point = target.GetBestKnownSolution(dimension);
45        actual = target.Evaluate(point);
[3781]46        Assert.AreEqual(expected, actual);
47      }
48    }
49  }
50}
Note: See TracBrowser for help on using the repository browser.