[13421] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13421] | 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 |
|
---|
| 22 | using HeuristicLab.Core;
|
---|
| 23 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
[16565] | 24 | using HEAL.Attic;
|
---|
[13421] | 25 |
|
---|
[14111] | 26 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[16565] | 27 | [StorableType("D79FD6F1-CB7D-4374-8F82-A6A98B35E95D")]
|
---|
[13421] | 28 | /// <summary>
|
---|
| 29 | /// An interface which represents an evaluation operator for multi objective test functions.
|
---|
| 30 | /// </summary>
|
---|
[13776] | 31 | public interface IConstrainedTestFunction : INamedItem {
|
---|
[13421] | 32 |
|
---|
[13776] | 33 | /// <summary>
|
---|
| 34 | /// checks whether a given solution violates the contraints of this function
|
---|
| 35 | /// </summary>
|
---|
| 36 | /// <param name="point"></param>
|
---|
| 37 | /// <param name="objectives"></param>
|
---|
| 38 | /// <returns>a double array that holds the distances that describe how much every contraint is violated (0 is not violated) </returns>
|
---|
| 39 | double[] CheckConstraints(RealVector point, int objectives);
|
---|
[13421] | 40 | }
|
---|
| 41 | }
|
---|