https://www.worldscientific.com/worldscinet/apjor
Methoden aus ganzzahliger Optimierung und Verbandstheorie zur Behandlung eines stochastischen dynamischen Transportproblems. - Stützerbach : [Libri Books on Demand]. - 164 S. : Zugl.: Ilmenau, Techn. Univ., Habil.-Schr., 1997
ISBN 3-89811-879-7
Hergestellt on demand
[Rezension von: Dontchev, Asen L., 1948-, Well-posed optimization problems]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 1, S. 28
, Rezension von : Dontchev, Asen L., 1948-: Well-posed optimization problems. - Berlin [u.a.] : Springer, 1993
https://doi.org/10.1007/BF01539877
[Rezension von: Sakawa, Masatoshi, 1947-, Fuzzy sets and interactive multiobjective optimization]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 4, S. 230
, Rezension von : Sakawa, Masatoshi, 1947-: Fuzzy sets and interactive multiobjective optimization. - New York, NY [u.a.] : Plenum Press, 1993
https://doi.org/10.1007/BF01540161
[Rezension von: Gregory, Geoffrey, Decision analysis]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 4, S. 208
, Rezension von : Gregory, Geoffrey: Decision analysis. - New York [u.a.] : Plenum Press, 1988
https://doi.org/10.1007/BF01540157
Essential supremum and supremum of summable functions. - In: Numerical functional analysis and optimization, ISSN 0163-0563, Bd. 17 (1996), 1/2, S. 167-180
Let D be a subset of R^n with positive finite Lebesgue measure and f on D an arbitrary real summable function. Then the function F of a, defined by the integral of f - a over all x of D with f(x) larger as or equal to a, is continuous, non-negative, non-increasing, convex, and has almost everywhere the measure of the level set as derivative F'(a). Further on, it holds that the essential supremum of f is given by the supremum of all a with F(a)>0. These properties can be used for computing the essential supremum of f. As example, two algorithms are stated. If the function f is dense, or lower semicontinuous, or if -f is robust, then supremum and the essential supremum of f coincide. In this case, the algorithms mentioned can be applied for determining the supremum of f, i.e., also the global maximum of f if it exists.
[Rezension von: Economic and financial modeling with mathematica®]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 1, S. 4
, Rezension von
https://doi.org/10.1007/BF01719724
[Rezension von: Peressini, Anthony L., 1934-, The mathematics of nonlinear programming]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 1, S. 54
, Rezension von : Peressini, Anthony L., 1934-: The mathematics of nonlinear programming. - New York, NY [u.a.] : Springer, 1993
https://doi.org/10.1007/BF01719735
[Rezension von: Hiriart-Urruty, Jean-Baptiste, 1949-, Convex analysis and minimization algorithms]. - In: OR spectrum. - Berlin : Springer, ISSN 1436-6304, 2/3, S. 192
, Rezension von : Hiriart-Urruty, Jean-Baptiste, 1949-: Convex analysis and minimization algorithms. 1, Fundamentals. - Berlin [u.a.] : Springer, 1993
Rezension von : Hiriart-Urruty, Jean-Baptiste, 1949-: Convex analysis and minimization algorithms. 2, Advanced theory and bundle methods. - Berlin [u.a.] : Springer, 1993
https://doi.org/10.1007/BF01719264
Sufficient conditions of optimality for optimal control problems governed by integral operators. - In: Operations research proceedings 1994, (1995), S. 209-214
We consider mixed suffucient conditions of optimality for abstract optimal control problems being local w.r.t. the state variable and global w.r.t. to the control variable. Using a special kind of augmented Lagrangian we don't need the kernel of the first derivative of the state equation (or inequality) for the formulation of the sufficient conditions. An example of its application to control problems with integral operators is given.