ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (278)
  • finite elements  (150)
  • optimization  (132)
  • Mathematics  (278)
Collection
  • Articles  (278)
Publisher
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 52 (1991), S. 11-17 
    ISSN: 1436-4646
    Keywords: Modeling ; cancer ; optimization ; optimal control ; drug delivery
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the problems of modeling the tumor growth and optimize the chemotherapy treatment. A biologically based model is used with the goal of solving an optimization problem involving discrete delivery of antineoplastic drugs. Our model is formulated via compartmental analysis in order to take into account the cell cycle. The cost functional measures not only the final size of the tumor but also the total amount of drug delivered. We propose an algorithm based on the discrete maximum principle to solve the optimal drug schedule problem. Our numerical results show nice interpretations from the medical point of view.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 15 (1994), S. 235-246 
    ISSN: 1436-6304
    Keywords: Simulation ; Optimierung ; Ernteprozeß ; Bedienungsprozeß ; räumliche Aspekte ; Einflußgröße ; Zielgröße ; Bewertungsprozeß ; Simulation ; optimization ; harvesting process ; operational process ; spacious aspects ; influence factor ; target value ; valuation process
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Abstract There is a wide range of possibilities for optimizing harvest process as transport-connected operations in a flow system. They are multi-stage operating process charakterized by a mixed arrangement of the operating elements. Above that, they have distinct spacious aspects. It is demonstrated which charakteristics of such processes have to be simulated by models, what target values should be determined in dependence on which influence factors and under which operational conditions. Furthermore it is elucidated how the valuation process for obtaining the desired information has to be shaped.
    Notes: Zusammenfassung Bei der Gestaltung von Ernteprozessen — beispielsweise des Prozesses „Mähdrusch, Körnertransport und -abnahme“ — als transportverbundene Fließarbeitsverfahren mit mindestens zwei verschiedenen Arbeitsmitteln gibt es einen großen Optimierungsspielraum. Solche Prozesse sind mehrstufige Bedienungsprozesse mit gemischter Anordnung der Bedienungseinrichtungen. Außerdem besitzen sie stark ausgeprägte räumliche Aspekte. Es wird vor allem gezeigt, welche Merkmale solcher Prozesse in Simulationsmodellen abgebildet sein müssen, welche Zielgrößen in Abhängigkeit von welchen Einflußgrößen unter Berücksichtigung welcher Prozeßbedingungen ermittelt werden sollten und wie der Bewertungsprozeß zur Ermittlung der gewünschten Informationen gestaltet werden muß.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1436-6304
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; Latin hypercube ; optimization ; sampling ; sensitivity analysis ; Stichprobenverfahren ; Permutationsmatrizen ; implizite Funktionen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Lateinische Hyperwürfel Stichprobenverfahren (LHS) dienen dazu, in geeigneter Weise die Verteilungsfunktion (zumindest angenähert) der Funktionswerte einer komplexen (impliziten) Funktion, in Abhängigkeit ihrer Variablen werte, zu schätzen. Anwendungen finden sich in Modellen, in denen erforderliche Variablenumformungen nicht möglich sind und in denen die Zahl der Simulationsläufe aus zeitlichen Gründen gering zu halten oder fixiert ist. Es stellt sich die Frage, welche Werte in jedem Lauf den Variablen zuzuordnen sind. Herkömmliche Vorgehensweisen benutzen ausgefeilte, geschichtete Stichprobenverfahren, die jedoch Fehler bei der Bestimmung von Varianz und Kovarianz, aufgrund der Korrelation der Stichprobenpaare, beinhalten können. In dieser Arbeit wird eine Methode beschrieben, den absoluten Fehler zwischen dem tatsächlichen und dem korrelierenden Stichprobenpaar so klein wie möglich zu halten. Selbst für kleine Stichprobenumfänge können dabei schon optimale Pläne erzielt werden. Permutationsmatrizen haben die Eigenschaft, die Summe der Korrelationen zwischen Spaltenpaaren zu minimieren. Die vorgestellte Heuristik ist in der Lage, in allen getesteten Fällen das Optimum zu finden.
    Notes: Abstract The objective of Latin Hypercube Sampling is to determine an effective procedure for sampling from a (possibly correlated) multivariate population to estimate the distribution function (or at least a significant number of moments) of a complicated function of its variables. The typical application involves a computer-based model in which it is largely impossible to find a way (closed form or numerical) to do the necessary transformation of variables and where it is expensive to run in terms of computing resources and time. Classical approaches to hypercube sampling have used sophisticated stratified sampling techniques; but such sampling may provide incorrect measures of the output parameters' variances or covariances due to correlation between the sampling pairs. In this work, we offer a strategy which provides a sampling specification minimizing the sum of the absolute values of the pairwise differences between the true and sampled correlation pairs. We show that optimal plans can be obtained for even small sample sizes. We consider the characteristics of permutation matrices which minimize the sum of correlations between column pairs and then present an effective heuristic for solution. This heuristic generally finds plans which match the correlation structure exactly. When it does not, we provide a hybrid lagrangian/heuristic method, which empirically has found the optimal solution for all cases tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 61 (1993), S. 19-37 
    ISSN: 1436-4646
    Keywords: Self-scaling ; BFGS method ; quasi-Newton method ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study the self-scaling BFGS method of Oren and Luenberger (1974) for solving unconstrained optimization problems. For general convex functions, we prove that the method is globally convergent with inexact line searches. We also show that the directions generated by the self-scaling BFGS method approach Newton's direction asymptotically. This would ensure superlinear convergence if, in addition, the search directions were well-scaled, but we show that this is not always the case. We find that the method has a major drawback: to achieve superlinear convergence it may be necessary to evaluate the function twice per iteration, even very near the solution. An example is constructed to show that the step-sizes required to achieve a superlinear rate converge to 2 and 0.5 alternately.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 5 (1985), S. 599-612 
    ISSN: 1572-9338
    Keywords: Microcomputers ; spreadsheets ; linear programming ; optimization ; software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper discusses the advantages of using spreadsheets for problem specification and report generation in optimization projects. It summarizes some of the mathematical programming software which is compatible with popular spreadsheets. A small production planning problem is used to illustrate the steps in input and processing of the results. Two programs are compared in detail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 6 (2000), S. 39-64 
    ISSN: 1572-9397
    Keywords: telecommunication networks ; optimization ; network design ; equipment placement ; switched network ; router network ; internet
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the performance and cost of such networks. Generally, this complexity implies that it may not even be clear what constitutes a “good” network design for a particular specification. Different network owners or operators may view the same solution differently, depending on their unique needs and perspectives. Nevertheless, we have observed a core common issue arising in the early stages of network design efforts involving leading-edge broadband switched technologies such as ATM, Frame Relay, and SMDS; or even Internet IP router networks. This core issue can be stated as follows: Given a set of service demands for the various network nodes, where should switching or routing equipment be placed to minimize the Installed First Cost of the network? Note that the specified service demands are usually projections for a future scenario and generally entail significant uncertainty. Despite this uncertainty, we have found that network owners and operators generally feel it is worthwhile to obtain high-level advice on equipment placement with a goal of minimizing Installed First Cost. This paper reports on a heuristic approach we have implemented for this problem that has evolved out of real network design projects. A tool with both a Solution Engine and an intuitive Graphical User Interface has been developed. The approach is highly efficient; for example, the tool can often handle LATA-sized networks in seconds or less on a workstation processor. By using only nodal demands rather than the more complex point-to-point demands usually required in tools of this sort, we have created an approach that is not only highly efficient, but is also a better match to real design projects in which demand data is generally scant and highly uncertain.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 295-321 
    ISSN: 1572-9397
    Keywords: multi-agent systems ; autonomous agents ; cooperation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Experiments over a variety of optimization problems indicate that scale-effective convergence is an emergent behavior of certain computer-based agents, provided these agents are organized into an asynchronous team (A-Team). An A-Team is a problem-solving architecture in which the agents are autonomous and cooperate by modifying one another's trial solutions. These solutions circulate continually. Convergence is said to occur if and when a persistent solution appears. Convergence is said to be scale-effective if the quality of the persistent solution increases with the number of agents, and the speed of its appearance increases with the number of computers. This paper uses a traveling salesman problem to illustrate scale-effective behavior and develops Markov models that explain its occurrence in A-Teams, particularly, how autonomous agents, without strategic planning or centralized coordination, can converge to solutions of arbitrarily high quality. The models also perdict two properties that remain to be experimentally confirmed: • construction and destruction are dual processes. In other words, adept destruction can compensate for inept construction in an A-Team, and vice-versa. (Construction refers to the process of creating or changing solutions, destruction, to the process of erasing solutions.) • solution quality is independent of agent-phylum. In other words, A-Teams provide an organizational framework in which humans and autonomous mechanical agents can cooperate effectively.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Potential analysis 5 (1996), S. 183-205 
    ISSN: 1572-929X
    Keywords: Elliptic equations ; Hamilton-Jacobi equations ; optimization ; rearrangements ; 35J25 ; 35J70 ; 49K20 ; 49K30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we study the case of equalities in some comparison results for L 1-norm or L ∞-norm of the solutions of Dirichlet elliptic problem or Hamilton-Jacobi equations. We show that equalities are achieved only in spherically symmetric situations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 379-402 
    ISSN: 1572-9338
    Keywords: Optimal control ; stochastic control ; dynamic systems ; economics ; public-sector applications ; optimization ; budgetary policies ; monetary policy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we determine optimal budgetary and monetary policies for Austria using a small macroeconometric model. We use a Keynesian model of the Austrian economy, called FINPOL1, estimated by ordinary least squares, which relates the main objective variables of Austrian economic policies, such as the growth rate of real gross domestic product, the rate of unemployment, the rate of inflation, the balance of payments, and the ratio of the federal budget deficit to GDP, to fiscal and monetary policy instruments, namely expenditures and revenues of the federal budget and money supply. Optimal fiscal and monetary policies are calculated for the model under a quadratic objective function using the algorithm OPTCON for the optimum control of nonlinear stochastic dynamic systems. Several control experiments are performed in order to assess the influence of different kinds of uncertainty on optimal budgetary and monetary policies. Apart from deterministic optimization runs, different assumptions about parameter uncertainties are introduced; the results of these different stochastic optimum control experiments are compared and interpreted.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 287-311 
    ISSN: 1572-9338
    Keywords: Probability functions ; gradient of integral ; sensitivity analysis ; optimization ; discrete event dynamic systems ; shut-down problem ; probabilistic risk analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Probability functions depending upon parameters are represented as integrals over sets given by inequalities. New derivative formulas for the intergrals over a volume are considered. Derivatives are presented as sums of integrals over a volume and over a surface. Two examples are discussed: probability functions with linear constraints (random right-hand sides), and a dynamical shut-down problem with sensors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...