Introduction and Problem Formulation
In optimization one investigates problems of the determination of a minimal point of a functional on a nonempty subset of a real linear space. To be more specific this means: Let X be a real linear space, let S be a nonempty subset of X, and let f : S → ℝ be a given functional. We ask for the minimal points of f on S. An element \(\bar x \in S\) is called a minimal point of f on S if
The set S is also called constraint set, and the functional f is called objective functional.
$$f(\bar x)f(x)for\,all\,x \in S.$$
KeywordsDesign Variable Problem Formulation Minimal Point Nonempty Subset Simple Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1994