Documentation/Modules/ProblemSimple

ProblemSimple - A Simple Optimization Problem

Summary

The module ProblemSimple contains a very simple optimization problem, which can be used to illustrate the optimization process. It contains a time delay, which allows to reduce the speed of evaluations. This can be used e.g. to show the convergence of an optimization algorithm in a presentation.

Properties

General

Algorithm	deterministic test function.
Design Variables	Continuous, discrete, or mixed variables.
Objectives	single-objective for minimization.
Constraints	none
Boundaries	set to fixed value.
Initial Search Region	not set.
Typical X	not set.
Initialization	sets problem properties.

Connections

Starting at his module	-
Ending at this module	Connections of type optimization

Actions

Name	Description
-	-

Options

The options are the number of discrete and continuous variables and an optional time delay for per evaluation.

Module Description

Computation of the Objective

The single objective function f is a quadratic function. More precisely, f is computed as the square of all continuous and discrete variables.

f(x) = sum_i(x_i²)

This function is also referred to as the sphere function.

Usage

-

Source Code

ToDo:Link to SVN

References

-