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  (146)
  • optimization  (146)
  • Mathematics  (132)
  • Energy, Environment Protection, Nuclear Power Engineering  (14)
Collection
  • Articles  (146)
Publisher
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 277-294 
    ISSN: 1436-3259
    Keywords: Water distribution ; optimization ; nonlinear programming ; integer programming ; chance constraints ; rehabilation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract This paper presents the mathematical development of an integer — nonlinear programming chance — constrained optimization model for the minimum cost rehabilitation/replacement of water distribution system components. Particular attention is given to the handling of uncertainties in the roughness factors and the loading conditions including both the random demand and preassure head requirements. The advantages of the proposed model include the ability to: 1) handle the optimal timing of rehabilitation/replacement for water distribution system components; 2) link a mixed-integer linear program solver, a nonlinear program solver, and a hydraulic simulator into an optimization framework; 3) handle the uncertainties of some of the variables; 4) incorporate various kinds of cost functions; and 5) handle multiple loading conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    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 ...
  • 3
    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 ...
  • 4
    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 ...
  • 5
    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 ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 8 (1994), S. 301-317 
    ISSN: 1436-3259
    Keywords: Change ; discontinued stations ; entropy ; networks ; optimization ; prediction ; unbiased ; water quality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract A new methodology for predicting water quality values at discontinued water quality monitoring stations is proposed. The method is based upon the Principle of Maximum Entropy (POME) and provides unbiased predictions of water quality levels at upstream tributaries and on the mainstem of a river given observed changes in the distribution of the same water quality parameter at a downstream location. Changes in the values of water quality parameters which are known a priori to have occurred upstream, but which are not sufficiently large to account for all the observed change in the same water quality parameter at the downstream location are able to be incorporated in the method through the introduction of a new term in the basic entropy expression. Application of the procedure to water quality monitoring on the Mackenzie River in Queensland, Australia indicates the method has considerable potential for prediction of water quality at discontinued stations. The method also has potential for identifying the location of causes of observed changes in water quality at a downstream station.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    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 ...
  • 8
    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 ...
  • 9
    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 ...
  • 10
    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 ...
  • 11
    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 ...
  • 12
    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 ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 3 (1997), S. 63-81 
    ISSN: 1572-9397
    Keywords: Large-step Markov chain ; optimization ; simulated annealing ; traveling salesman problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The large-step Markov chain (LSMC) approach is the most effective known heuristic for large symmetric TSP instances; cf. recent results of [Martin, Otto and Felten, 1991] and [Johnson, 1990]. In this paper, we examine relationships among (i) the underlying local optimization engine within the LSMC approach, (ii) the “kick move” perturbation that is applied between successive local search descents, and (iii) the resulting LSMC solution quality. We find that the traditional “double-bridge” kick move is not necessarily optimum: stronger local optimization engines (e.g., Lin-Kernighan) are best matched with stronger kick moves. We also propose use of an adaptive temperature schedule to allow escape from deep basins of attraction; the resulting hierarchical LSMC variant outperforms traditional LSMC implementations that use uniformly zero temperatures. Finally, a population-based LSMC variant is studied, wherein multiple solution paths can interact to achieve improved solution quality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 36 (1992), S. 101-124 
    ISSN: 1572-9338
    Keywords: Computer networks ; feedback control ; flow control ; optimization ; routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The performance of a network subject to either state dependent or state independent flow control is investigated. In the state dependent case, the flow control policy is a function of the total number of packets for which the controller has not yet received an acknowledgment. In this case it is shown that the optimal flow control is a sliding window mechanism. The effect of the delayed feedback on the network performance as well as the size of the window are studied. The state independent optimal rate is also derived. The performance of the state dependent and state independent flow control policies are compared. Conditions for employing one of the two types of flow control policies for superior end-to-end network performance are discussed. All the results obtained are demonstrated using simple examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 5 (1985), S. 613-630 
    ISSN: 1572-9338
    Keywords: Microcomputers ; computer programs ; mathematical programming ; software ; optimization ; management science ; operations research
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper provides a summary of some OR/MS software for microcomputers. Lists of packages in many management science techniques are included. A bibliography of other papers is also included. We also summarize the general features of packages in each category. Finally, we mention a few sources to help the reader keep up with the developments in this area.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 57 (1995), S. 217-232 
    ISSN: 1572-9338
    Keywords: Scheduling ; robotic cell ; tandem machines ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operationsn, an optimalO(n logn)-time algorithm is proposed together with the proof of optimality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 281-287 
    ISSN: 1572-9397
    Keywords: optimization ; benchmarking ; overfitting ; general and targeted methods ; method applicability ; practical relevance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Benchmark problems should be hard. True. Methods for solving problems should be useful for more than just “beating” a particular benchmark. Truer still, we believe. In this paper, we examine the worthiness of the approach consisting of concentration on a particular set of benchmark problems, an issue raised by a recent paper by Ian Gent. We find that such a methodology can easily lead to publications of limited general use as far as our ability to solve practical problems is concerned.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Set-valued analysis 1 (1993), S. 379-392 
    ISSN: 1572-932X
    Keywords: Primary: 49J52 ; Secondary: 58C20 ; Generalized second derivatives ; nonsmooth analysis ; epi-derivatives ; fully amenable functions ; integral functionals ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Epi-derivatives have many applications in optimization as approached through nonsmooth analysis. In particular, second-order epi-derivatives can be used to obtain optimality conditions and carry out sensitivity analysis. Therefore the existence of second-order epi-derivatives for various classes of functions is a topic of considerable interest. A broad class of composite functions on ℝ n called ‘fully amenable’ functions (which include general penalty functions composed withC 2 mappings, possibly under a constraint qualification) are now known to be twice epi-differentiable. Integral functionals appear widely in problems in infinite-dimensional optimization, yet to date, only integral functionals defined by convex integrands have been shown to be twice epi-differentiable, provided that the integrands are twice epi-differentiable. Here it is shown that integral functionals are twice epi-differentiable even without convexity, provided only that their defining integrands are twice epi-differentiable and satisfy a uniform lower boundedness condition. In particular, integral functionals defined by fully amenable integrands are twice epi-differentiable under mild conditions on the behavior of the integrands.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 243-260 
    ISSN: 1572-9338
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; latin hypercube ; optimization ; sampling ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Latin hypercube sampling is often used to estimate the distribution function of a complicated function of many random variables. In so doing, it is typically necessary to choose a permutation matrix which minimizes the correlation among the cells in the hypercube layout. This problem can be formulated as a generalized, multi-dimensional assignment problem. For the two-dimensional case, we provide a polynomial algorithm. For higher dimensions, we offer effective heuristic and bounding procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 8 (1987), S. 351-362 
    ISSN: 1572-9338
    Keywords: Response surface methodology ; simulation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Managing the volume of experimental and/or simulation data required for large-scale design studies can be a significant problem. This paper describes a method for dealing with this problem, using response surface methodology. The method involves (1) determining a summary parameterization of the response of the underlying process mechanism generating the data, in order to characterize this response in terms of a manageable set of performance measures, and (2) deriving a model of the data, in order to summarize the dependence of the performance measures on selected predictor or design variables. The method is illustrated by its application to a problem in vehicle collision research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 47-62 
    ISSN: 1572-9397
    Keywords: tabu search ; frequency ; assignment ; constraints ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the reuse of frequencies. This problem, known to be NP-hard, is of great importance in practice since better solutions will allow a telecommunications operator to manage larger cellular networks. This paper presents a new Tabu Search algorithm for this application. The algorithm is tested on realistic and large problem instances and compared with other methods based on simulated annealing, constraint programming and graph coloring algorithms. Empirical evidence shows that the Tabu algorithm is very competitive by giving the best solutions to the tested instances.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    BIT 7 (1967), S. 206-215 
    ISSN: 1572-9125
    Keywords: Extraction ; file ; optimization ; output
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In commercial and administrative ADP it often happens that there is one large master file and many output files are to be made from this. One possible solution to avoid using the master file many times is to construct from it a few extraction files and from these compile the output files. In the following paper a method is described to define the extraction files and to optimize their contents by zero-one programming. An algorithm and an example are presented in a simplified case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 48 (1997), S. 13-32 
    ISSN: 1572-9036
    Keywords: limit cycles ; vector fields ; oscillation theory ; second-order dynamic systems ; qualitative theory of dynamic systems ; phase portrait ; optimization ; 16th Hilbert Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a solution to the problem to find isolated closed trajectories of two-dimensional dynamic systems. In contrast to the method of Bendixson’s ring regions, the new method is constructive. It allows the determination of the location of closed trajectories and therefore gives an upper bound for their number. The method is based on the idea to use inherent geometrical and physical extremal properties of these trajectories to transform the problem into an optimization task (isoperimetric problem of variational calculus) that can be solved by numerical algorithms, e.g., by hillclimbing.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    BIT 36 (1996), S. 494-508 
    ISSN: 1572-9125
    Keywords: Conjugate gradient ; Lanczos ; Newton's Method ; optimization ; signal processing ; electronic structures ; differential geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Numerical analysts, physicists, and signal processing engineers have proposed algorithms that might be called conjugate gradient for problems associated with the computation of eigenvalues. There are many variations, mostly one eigenvalue at a time though sometimes block algorithms are proposed. Is there a correct “conjugate gradient” algorithm for the eigenvalue problem? How are the algorithms related amongst themselves and with other related algorithms such as Lanczos, the Newton method, and the Rayleigh quotient?
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    BIT 6 (1966), S. 212-227 
    ISSN: 1572-9125
    Keywords: Data ; processing ; register ; maintenance ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Data processing nowadays represents a considerable investment and it is important to use computers as efficiently as possible. Criteria separating the best alternative from other ones would be very useful. In this article we have tried to find some criteria for the optimization of register maintenance applying the simplest methods of operations research. In particular the use of a change register has been investigated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 61 (1993), S. 281-300 
    ISSN: 1436-4646
    Keywords: Variational inequalities ; descent methods ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a framework for descent algorithms that solve the monotone variational inequality problem VIP v which consists in finding a solutionv *∈Ω v satisfyings(v *)T(v−v *)⩾0, for allv∈Ω v. This unified framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formulation and a proof of its convergence is given. Based on this unified logarithmic framework, we show that a variant of the descent method where each subproblem is only solved approximately is globally convergent under certain conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Journal of fusion energy 4 (1985), S. 315-319 
    ISSN: 1572-9591
    Keywords: optimization ; SENRI ; blanket ; tritium ; breeding ; energy multiplication ; molten salt ; nonbreeding ; hybrid ; support ratio
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: Abstract Neutronic calculations were performed to optimize the SENRI blanket in terms of energy multiplication as well as tritium breeding ratio. The blanket employs a thick (∼ 64-cm) Li layer as breeder/coolant. Three approaches were taken here to achieve the goal: (1) reduction of6Li in the lithium, (ii) replacement of the Li layer by a molten-salt (flibe) layer, and (iii) shipment of excess tritium to a nonbreeding blanket. It was found that the excess tritium produced in the SENRI blanket could be used effectively to obtain additional power by fueling a nonbreeding D-T reactor.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Methodology and computing in applied probability 2 (2000), S. 37-58 
    ISSN: 1387-5841
    Keywords: optimization ; simulation ; Markov chain ; Monte Carlo
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We have recently developed a global optimization methodology for solving combinatorial problems with either deterministic or stochastic performance functions. This method, the Nested Partitions (NP) method has been shown to generate a Markov chain and with probability one to converge to a global optimum. In this paper, we study the rate of convergence of the method through the use of Markov Chain Monte Carlo (MCMC) methods, and use this to derive stopping rules that can be applied during simulation-based optimization. A numerical example serves to illustrate the feasibility of our approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Journal of nonlinear science 3 (1993), S. 307-327 
    ISSN: 1432-1467
    Keywords: bifurcation ; saddle node ; Hopf ; stability ; robustness ; optimization ; numerical methods ; transcritical ; pitchfork ; extended systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Summary Engineering and physical systems are often modeled as nonlinear differential equations with a vector λ of parameters and operated at a stable equilibrium. However, as the parameters λ vary from some nominal value λ0, the stability of the equilibrium can be lost in a saddle-node or Hopf bifurcation. The spatial relation in parameter space of λ0 to the critical set of parameters at which the stable equilibrium bifurcates determines the robustness of the system stability to parameter variations and is important in applications. We propose computing a parameter vector λ* at which the stable equilibrium bifurcates which is locally closest in parameter space to the nominal parameters λ0. Iterative and direct methods for computing these locally closest bifurcations are described. The methods are extensions of standard, one-parameter methods of computing bifurcations and are based on formulas for the normal vector to hypersurfaces of the bifurcation set. Conditions on the hypersurface curvature are given to ensure the local convergence of the iterative method and the regularity of solutions of the direct method. Formulas are derived for the curvature of the saddle node bifurcation set. The methods are extended to transcritical and pitchfork bifurcations and parametrized maps, and the sensitivity to λ0 of the distance to a closest bifurcation is derived. The application of the methods is illustrated by computing the proximity to the closest voltage collapse instability of a simple electric power system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 32 (1993), S. 123-156 
    ISSN: 1572-9036
    Keywords: 49M99 ; 58F13 ; 90B50 ; Golden Section ; Fibonacci ; optimization ; dynamic process ; chaos ; fractal ; Lyapunov ; exponent
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Certain search algorithms produce a sequence of decreasing regions converging to a pointx *. After renormalizing to a standard region at each iteration, the renormalized location ofx *, sayx x, may obey a dynamic process. In this case, simple ergodic theory might be used to compute asymptotic rates. The family of ‘second-order’ line search algorithms which contains the Golden Section (GS) method have this property. The paper exhibits several alternatives to GS which have better almost sure ergodic rates of convergence for symmetric functions despite the fact that GS is asymptotically minimax. The discussion in the last section includes weakening of the symmetry conditions and announces a backtracking bifurcation algorithm with optimum asymptotic rate.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 199-224 
    ISSN: 1573-1502
    Keywords: environmental policy ; pulp and paper ; life cycle ; optimization ; technology lock-in ; recycling ; geography of production ; environment-trade conflict
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract In this paper, we propose a methodology, based on materials accounting and operational research techniques, to assess different industry configurations according to their life cycle environmental impacts. Rather than evaluating a specific technology, our methodology searches for the feasible configuration with the minimum impact. This approach allows us to address some basic policy-relevant questions regarding technology choice, investment priorities, industrial structures, and international trade patterns. We demonstrate the methodology in the context of the European pulp and paper industry. We are able to show that current environmental policy's focus on maximizing recycling is optimal now, but that modest improvements in primary pulping technology may shift the optimal industry configuration away from recycling toward more primary pulping with incineration. We show that this will have significant implications for the amount and type of environmental damage, for the location of different stages in the production chain, and for trade between European member states. We caution policy makers that their single-minded focus on recycling may foreclose investment in technologies that could prove environmentally superior. Finally, we hint that member state governments may be fashioning their environmental policy positions at least in part on some of the trade and industrial implications we find.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 409-427 
    ISSN: 1573-1502
    Keywords: structural diversity ; optimization ; resource management
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract This paper introduces a computationally convenient measure of structural diversity based on absolute deviations between relative shares of individual groups forming a community. A conceptual framework is developed, some theoretical properties of the measure are derived, and its close relation to the Shannon index, a widely used diversity measure, is explored. The paper also presents an empirical application involving this measure where optimum harvesting strategies are determined under diversity constraints, and investigates the trade off between economic and environmental objectives for a mixed forest in Indonesia.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 12 (1996), S. 321-346 
    ISSN: 1572-9265
    Keywords: Capillarity ; numerical approximation ; optimization ; 65Dxx ; 65Gxx ; 65K10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose an algorithm to compute an approximation of capillary surfaces in a gravitational field. This algorithm is based on a decomposition-coordination method by augmented lagrangians and the discretization is done using the finite element method. We study the convergence of the algorithm and the error of discretization for the axisymmetric case; some numerical results are given. This method can be generalized to a two-dimensional space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical chemistry 28 (2000), S. 389-401 
    ISSN: 1572-8897
    Keywords: genetic algorithms ; optimization ; transition state structures ; fitness value
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology , Mathematics
    Notes: Abstract Geometry optimization of transition state structures (first order saddle points) has proven to be a challenging problem in theoretical chemistry. Despite many attempts, no method has been developed that can guarantee convergence to a transition structure. The well-known method of genetic algorithms (GA's) was adapted for this problem, and designed to seek points on a potential energy surface with a zero gradient norm and one negative eigenvalue in the Hessian. A description of genetic algorithms and the software written to optimize first order saddle points is given. The software developed was tested on a mathematical function having minima, maxima, and first order saddle points. The method was capable of finding all of the saddle points, as the results presented demonstrate. Optimization of various transition state structures was then attempted. Although the current genetic algorithm software requires long run times, the algorithm will preferentially seek first order saddle points, weeding out any other stationary points. Thus, the initial guess at the optimum is not as critical as with other methods, and as well, multiple saddle points can be found.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 11 (1990), S. 1113-1117 
    ISSN: 1573-2754
    Keywords: inverse problem ; wave equation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract We introduce a multi-cost-functional method for solving inverse problems of wave equations. This method has its simplicity, efficiency and good physical interpretation. It has the advantage of being programmed for two- or three- (space) dimensional problems as well as for one-dimensional problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 21 (1989), S. 221-232 
    ISSN: 1573-8868
    Keywords: Fracture hydrology ; network ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract Numerically generated discrete fracture networks are used to simulate the flow of water through rock fractures. The fractures are modeled as random assemblages of conductive elements in a nonconductive matrix. Because large numbers of fractures often are needed to represent fractured rock adequately, minimizing the required computer time and memory is crucial. For steady-state flow, any portion of the mesh that is linked to the rest of the mesh by only one point is a dead end and does not contribute to water flow. The removal of such dead-end clusters simplifies the mesh and therefore speeds up computation, without changing its response. An algorithm for removing these dead ends is described in detail. Its effectiveness is discussed with regard to the connectivity of a network.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    ISSN: 1573-8868
    Keywords: simulation ; nonlinear conditioning ; optimization ; FFT ; local perturbation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract A fast Fourier transform (FFT) moving average (FFT-MA) method for generating Gaussian stochastic processes is derived. Using discrete Fourier transforms makes the calculations easy and fast so that large random fields can be produced. On the other hand, the basic moving average frame allows us to uncouple the random numbers from the structural parameters (mean, variance, correlation length, ... ), but also to draw the randomness components in spatial domain. Such features impart great flexibility to the FFT-MA generator. For instance, changing only the random numbers gives distinct realizations all having the same covariance function. Similarly, several realizations can be built from the same random number set, but from different structural parameters. Integrating the FFT-MA generator into an optimization procedure provides a tool theoretically capable to determine the random numbers identifying the Gaussian field as well as the structural parameters from dynamic data. Moreover, all or only some of the random numbers can be perturbed so that realizations produced using the FFT-MA generator can be locally updated through an optimization process.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 17 (1985), S. 195-208 
    ISSN: 1573-8868
    Keywords: geostatistics ; covariance estimation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract The parameters of covariance functions (or variograms) of regionalized variables must be determined before linear unbiased estimation can be applied. This work examines the problem of minimum-variance unbiased quadratic estimation of the parameters of ordinary or generalized covariance functions of regionalized variables. Attention is limited to covariance functions that are linear in the parameters and the normality assumption is invoked when fourth moments of the data need to be calculated. The main contributions of this work are (1) it shows when and in what sense minimum-variance unbiased quadratic estimation can be achieved, and (2) it yields a well-founded, practicable, and easy-to-automate methodology for the estimation of parameters of covariance functions. Results of simulation studies are very encouraging.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Discrete event dynamic systems 10 (2000), S. 307-324 
    ISSN: 1573-7594
    Keywords: stochastic algorithms ; ordinal optimization ; optimization ; hill climbing ; genetic algorithms ; manufacturing process design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Thispaper introduces ordinal hill climbing algorithms for addressingdiscrete manufacturing process design optimization problems usingcomputer simulation models. Ordinal hill climbing algorithmscombine the search space reduction feature of ordinal optimizationwith the global search feature of generalized hill climbing algorithms.By iteratively applying the ordinal optimization strategy withinthe generalized hill climbing algorithm framework, the resultinghybrid algorithm can be applied to intractable discrete optimizationproblems. Computational results on an integrated blade rotormanufacturing process design problem are presented to illustratethe application of the ordinal hill climbing algorithm. The relationshipbetween ordinal hill climbing algorithms and genetic algorithmsis also discussed. This discussion provides a framework for howthe ordinal hill climbing algorithm fits into currently appliedalgorithms, as well as to introduce a bridge between the twoalgorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Discrete event dynamic systems 10 (2000), S. 271-294 
    ISSN: 1573-7594
    Keywords: resource allocation ; simulation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Stochastic discrete resource allocation problems are difficult to solve. In this paper, we propose a new algorithm designed specifically to tackle them. The algorithm combines with the Nested Partitions method, the Ordinal Optimization techniques, and an efficient simulation control technique. The resulting hybrid algorithm retains the global perspective of the Nested Partitions method and the fast convergence properties of the Ordinal Optimization. Numerical results demonstrate that the hybrid algorithm can be effectively used for many large-scale stochastic discrete optimization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    ISSN: 1573-7594
    Keywords: optimization ; standard clock ; ordinal optimization ; communication network ; voice/data integration ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we apply the ideas of ordinal optimization and the technique of Standard Clock (SC) simulation to the voice-call admission-control problem in integrated voice/data multihop radio networks. This is an important problem in networking that is not amenable to exact analysis by means of the usual network modeling techniques. We first describe the use of the SC approach on sequential machines, and quantify the speedup in simulation time that is achieved by its use in a number of queueing examples. We then develop an efficient simulation model for wireless integrated networks based on the use of the SC approach, which permits the parallel simulation of a large number of admission-control policies, thereby reducing computation time significantly. This model is an extension of the basic SC approach in that it incorporates fixed-length data packets, whereas SC simulation is normally limited to systems with exponentially distributed interevent times. Using this model, we demonstrate the effectiveness of ordinal-optimization techniques, which provide a remarkably good ranking of admission-control policies after relatively short simulation runs, thereby facilitating the rapid determination of good policies. Moreover, we demonstrate that the use of crude, inaccurate analytical and simulation models can provide highly accurate policy rankings that can be used in conjunction with ordinal-optimization methods, provided that they incorporate the key aspects of system operation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical imaging and vision 9 (1998), S. 29-48 
    ISSN: 1573-7683
    Keywords: probabilistic relaxation ; relaxation labeling ; optimization ; combining evidence and contextual classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Traditional probabilistic relaxation, as proposed by Rosenfeld, Hummel and Zucker, uses a support function which is a double sum over neighboring nodes and labels. Recently, Pelillo has shown the relevance of the Baum-Eagon theorem to the traditional formulation. Traditional probabilistic relaxation is now well understood in an optimization framework. Kittler and Hancock have suggested a form of probabilistic relaxation with product support, based on an evidence combining formula. In this paper we present a formal basis for Kittler and Hancocks probabilistic relaxation. We show that it too has close links with the Baum-Eagon theorem, and may be understood in an optimization framework. We provide some proofs to show that a stable stationary point must be a local maximum of an objective function. We present a new form of probabilistic relaxation that can be used as an approximate maximizer of the global labeling with maximum posterior probability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical imaging and vision 3 (1993), S. 187-203 
    ISSN: 1573-7683
    Keywords: dichromatic ; specular ; reflectance ; color constancy ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A method for recovering the spectrum of both the interface and the body reflectance for images composed of dichromatic surfaces is presented. An important assumption is that the spectrum of the interface component is the same as that of the illuminant. It is also assumed that the image is presegmented into dichromatic patches, that surfaces possess specularities, and that these highlights change geometrically differently from the shading. The method is based on minimizing the sum of squares of deviations from the dichromatic model over all the patches in the image, by using finite-dimensional linear models to approximate spectral functions. We point out shortcomings in the accuracy of such models when specularities are present in images. Results are presented for synthesized images made up of shaded patches with highlights. It is shown that the method does reasonably well in recovering interface and body colors as well as the illuminant spectrum and body spectral reflectance function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    International journal of computers for mathematical learning 5 (2000), S. 189-209 
    ISSN: 1573-1766
    Keywords: computer algebra ; optimization ; Realistic Mathematics Education ; student behaviour ; symbolic calculators
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper describes a pilot study on the use of computer algebra at upper secondary level. A symbolic calculator was introduced in a pre-examination class studying for advanced pre-university mathematics. With the theoretical framework of Realistic Mathematics Education and Developmental Research as a background, the study focused on the identification of obstacles that students encountered while using computer algebra. Five obstacles were identified that have both a technical and a mathematical character. It is the author's belief that taking these barriers seriously is important in developing useful pedagogical strategies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 28 (1996), S. 895-907 
    ISSN: 1573-8868
    Keywords: reservoir geometry ; multiple-point histogram ; geological accretion ; optimization ; flow responses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract Large-scale reservoir architecture constitutes first-order reservoir heterogeneity and dietates to a large extent reservoir flow behavior. It also manifests geometric characteristics beyond the capability of traditional geostatistical models conditioned only on single-point and two-point statistics. Multiple-point statistics, as obtained by scanning a training image deemed representative of the actual reservoir, if reproduced properly provides stochastic models that better capture the essence of the heterogeneity. A “growth” algorithm, coupled with an optimization procedure, is proposed to reproduce target multiple-point histograms. The growth algorithm makes an analogy between geological accretion process and stochastic process and amounts to restricting the random path of sequential simulation at any given stage to a set of eligible nodes (immediately adjacent to a previously simulated node or sand grain). The proposed algorithm, combined with a multiple-grid approach, is shown to reproduce effectively the geometric essence of complex training images exhibiting long-range and curvilinear structures. Also, by avoiding a rigorous search for global minimum and accepting local minima, the proposed algorithm improves CPU time over traditional optimization procedures by several orders of magnitude. Average flow responses run on simulated realizations are shown to bracket correctly the reference responses of the training image.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 32 (2000), S. 87-108 
    ISSN: 1573-8868
    Keywords: heterogeneity ; geostatistics ; optimization ; inversion ; nonlinearity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract This paper describes a new method for gradually deforming realizations of Gaussian-related stochastic models while preserving their spatial variability. This method consists in building a stochastic process whose state space is the ensemble of the realizations of a spatial stochastic model. In particular, a stochastic process, built by combining independent Gaussian random functions, is proposed to perform the gradual deformation of realizations. Then, the gradual deformation algorithm is coupled with an optimization algorithm to calibrate realizations of stochastic models to nonlinear data. The method is applied to calibrate a continuous and a discrete synthetic permeability fields to well-test pressure data. The examples illustrate the efficiency of the proposed method. Furthermore, we present some extensions of this method (multidimensional gradual deformation, gradual deformation with respect to structural parameters, and local gradual deformation) that are useful in practice. Although the method described in this paper is operational only in the Gaussian framework (e.g., lognormal model, truncated Gaussian model, etc.), the idea of gradually deforming realizations through a stochastic process remains general and therefore promising even for calibrating non-Gaussian models.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 4 (1994), S. 131-140 
    ISSN: 1573-1375
    Keywords: Genetic algorithms ; scatter search ; optimization ; mathematical relaxation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We provide a tutorial survey of connections between genetic algorithms and scatter search that have useful implications for developing new methods for optimization problems. The links between these approaches are rooted in principles underlying mathematical relaxations, which became inherited and extended by scatter search. Hybrid methods incorporating elements of genetic algorithms and scatter search are beginning to be explored in the literature, and we demonstrate that the opportunity exists to develop more advanced procedures that make fuller use of scatter search strategies and their recent extensions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 4 (1994), S. 173-177 
    ISSN: 1573-1375
    Keywords: Maximum likelihood ; mixture models ; simulated annealing ; optimization ; hybrid algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Traditional (non-stochastic) iterative methods for optimizing functions with multiple optima require a good procedure for selecting starting points. This paper illustrates how the selection of starting points can be made automatically by using a method based upon simulated annealing. We present a hybrid algorithm, possessing the accuracy of traditional routines, whilst incorporating the reliability of annealing methods, and illustrate its performance for a particularly complex practical problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 199-224 
    ISSN: 1573-1502
    Keywords: environmental policy ; pulp and paper ; life cycle ; optimization ; technology lock-in ; recycling ; geography of production ; environment-trade conflict
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract In this paper, we propose a methodology, based on materials accounting and operational research techniques, to assess different industry configurations according to their life cycle environmental impacts. Rather than evaluating a specific technology, our methodology searches for the feasible configuration with the minimum impact. This approach allows us to address some basic policy-relevant questions regarding technology choice, investment priorities, industrial structures, and international trade patterns. We demonstrate the methodology in the context of the European pulp and paper industry. We are able to show that current environmental policy's focus on maximizing recycling is optimal now, but that modest improvements in primary pulping technology may shift the optimal industry configuration away from recycling toward more primary pulping with incineration. We show that this will have significant implications for the amount and type of environmental damage, for the location of different stages in the production chain, and for trade between European member states. We caution policy makers that their single-minded focus on recycling may foreclose investment in technologies that could prove environmentally superior. Finally, we hint that member state governments may be fashioning their environmental policy positions at least in part on some of the trade and industrial implications we find.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 25 (1991), S. 241-276 
    ISSN: 1572-9036
    Keywords: 62C10 ; 90Cxx ; 90Dxx ; 28Dxx ; 03Bxx ; Search ; screening ; optimization ; entropy ; sequential design ; Bayes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper reviews the theory of search. The main viewpoint is statistical but considerable space is spent on connections with other fields such as logic and optimisation. Three primitive ideas dominate: consistency, entropy, and Bayes' methods. The theory of screening provides one of the central examples and there is a section on nonsequential random search deriving from the work of Renyi. The game of ‘Bulls and Cows’ provides a motivating example for both sequential and nonsequential algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 33 (1993), S. 45-68 
    ISSN: 1572-9036
    Keywords: 60F05 ; 60F17 ; 62L20 ; Experimental design ; optimization ; loss function ; estimator ; Bayes.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of optimal experimental design for response optimization is considered. The optimal point (control)x * of a response surface is to be determined by estimating the response parametersθ from measurements performed at design pointsx i,i=1,...,N. Classical sequential approaches for choosing thex i's are recalled. A loss function related to the issue of response optimization is used to define control-oriented design criteria. The design policies differ depending on whether least-squares or minimum risk estimation is used to estimateθ. Connections between various criteria suggested in the literature are exhibited. Special attention is given to quadratic model responses. Most approaches presented assume that the response is correctly described by a given parametric function over the region of interest. Possible deterministic departures from this function raise the problem of model robustness, and the literature on the subject is briefly surveyed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 4 (1985), S. 115-137 
    ISSN: 1572-9036
    Keywords: 82A05 ; 90C39 ; Macromolecular structure ; dynamic programming ; optimization ; statistical mechanics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Recent advances in DNA and protein-sequencing technologies have made an increasing number of primary structures available for theoretical investigations. The prediction of a higher-order protein, and nucleic acid structure in particular, is an area where computational approaches will be able to complement the lack of experimental observations. We review some of the problems related to structure predictions: sequence homology searches, secondary structure prediction in RNAs, and regular structure prediction in proteins. The first two are mathematically well-defined problems, for it is not usually necessary to consider long-range interactions. The solution to a smaller segment is a part of the solution to the entire sequence. Thus, the problem can be solved by dynamic programming algorithms. The prediction of protein structures poses a more complex combinatorial problem, as illustrated in our statistical mechanical treatment. A promising approximation is to calculate locally optimal structures stabilized by relatively short-range interactions, and then to include longer-range effects as interactions between the locally optimal structures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Journal of fusion energy 4 (1985), S. 389-394 
    ISSN: 1572-9591
    Keywords: D-D reactor ; optimization ; blanket/shield ; SWAN ; energy gain ; atomic displacement ; perturbation theory ; D2O coolant ; neutron multiplier
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: Abstract Position-dependent optimization calculations have been carried out on a D-D fusion reactor blanket/shield to maximize the energy gain in the blanket and to minimize the atomic displacement rate of the copper stabilizer in the superconducting magnet. The results obtained by using the optimization code SWAN indicate (1) the advantage of D2O coolant over H2O coolant with respect to increasing the energy gain, and (2) the difference in the optimal shield distributions between D-T and D-D neutron sources. The possibility of improving both the energy gain and radiation shielding characteristics is also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Human ecology 23 (1995), S. 1-28 
    ISSN: 1572-9915
    Keywords: optimization ; nutrition ; subsistence ; nonlinear programming ; Mountain Pima
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Energy, Environment Protection, Nuclear Power Engineering , Ethnic Sciences
    Notes: Abstract A dynamic nonlinear optimization analysis of subsistence patterns of the Mountain Pima of Chihuahua, Mexico, included requirements for adequate amounts of calories, calcium, vitamin A, vitamin C, and balanced protein. Two methods of incorporating nonenergy nutritional needs into a time minimization program were compared. The first was a constraint model with sharp boundaries between adequacy and fatality. The second involved multiplying the total work time by a series of nutrient indexing factors. Each factor was calculated as a function of the ratio between the recommended and actual rates of intake for all months and nutrients considered. Oxalate composition of some resources and seasonal variation in resource availability were taken into account. Two sets of data were analyzed, one for a year of adequate rainfall, the other for a year of severe drought. The predictions of the indexing model agreed more closely with observed intake patterns than did the predictions of the constraint model.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Human ecology 13 (1985), S. 485-510 
    ISSN: 1572-9915
    Keywords: hunting ; game depletion ; optimization ; ritual ; tortoises
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Energy, Environment Protection, Nuclear Power Engineering , Ethnic Sciences
    Notes: Abstract Several investigators cite population control, frequent settlement relocation, trekking, expansion of diet breadth, and food taboos as strategic responses to game depletion by indigenous populations living in interfluvial zones of lowland South America. The Ka'apor Indians of the interfluvial forest of northern Maranhão, Brazil, employ other means of optimizing hunting efficiency, partly based on ritual. Menstruating women, pubescent girls, and parents of newborns can consume meat only of the tortoise (Gochelone denticulata), the first prey species to be hunted out of an area. Tortoise capture requires, on average, one full day of hunting. This means that the full potential of hunting pressure does not materialize near the settlement. Meat productivity is unusually high even near old settlements. I argue that ritual tortoise hunting helps to regulate environmental utilization, to maintain a sustained yield of meat protein, and to expand the catchment area gradually.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Human ecology 14 (1986), S. 415-435 
    ISSN: 1572-9915
    Keywords: prehistoric hunting ; optimization ; Tehuacan Valley
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Energy, Environment Protection, Nuclear Power Engineering , Ethnic Sciences
    Notes: Abstract Previous analyses of faunal remains from highland Mesoamerican sites have viewed implied changes in animal exploitation patterns as a secondary consequence of early agricultural practices. This paper argues that faunal data from the Tehuacan Valley, when interpreted within an optimization framework provide evidence for the alteration of optimal meat harvesting strategies through time by communities responding to a variety of socioenvironmental factors: seasonal and long-term availability of game, access to domestic meat resources, human meat demand levels, and scheduling constraints.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    ISSN: 1573-2932
    Keywords: Decision support system ; optimization ; air pollution ; sulphur ; critical load
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: Abstract A Spatial Decision Support System (SDSS) is being developed for Her Majesty's Inspectorate of Pollution (HMIP). It enables the investigation of the spatial implications of different operating procedures from large point sources of pollution. The environmental effect of emissions is assessed using the critical loads methodology developed at ITE and modelled deposition “footprints”. This approach allows an “effect per unit emission” or “pollution potential” to be determined for each source. Individual sources are modelled and included within the SDSS if their current emissions are above a given threshold. The SDSS provides a graphical user interface (GUI) which facilitates a fast, efficient and effective means to specify and to examine the effect of different operating policies. Mapping, statistical and optimization facilities are provided to help describe the effect of any specified strategy. Maps may be produced as deposition rates or exceedance values. Statistics may be visualised as histograms and scatter plots. The optimization facility uses linear programming to minimise the total environmental impact (estimated from emissions and critical loads) or maximise power produced within environmental limits. The SDSS has been written in the Arc/Info Macro Language (AML) and provides an invisible interface with standard GIS facilities and programmes written in “C”.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Environmental modeling and assessment 2 (1997), S. 167-175 
    ISSN: 1573-2967
    Keywords: reserve selection ; reserve design ; mathematical programming ; integer programming ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: Abstract During the last 10–15 years heuristic methods have been developed for problems in optimal reserve selection. Unfortunately, there is no guarantee that heuristics will find optimal solutions. In recognizing this limitation, analysts have formulated reserve selection problems as set covering problems, for which matrix reduction and integer (0/1) programming can be used to find optimal solutions. In this paper we restate the set covering formulation and review solution techniques. A new 0/1 programming model, which is a generalization of the set covering model, is then presented and applied to a hypothetical reserve selection problem. Objectives of minimizing the number of sites selected and maximizing the number of species represented are addressed. Solutions which characterize the tradeoffs between these objectives provide a rich set of information for planners and decision makers. Applications of mathematical programming to related problems in land use planning and forestry are also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 106 (2000), S. 297-307 
    ISSN: 1573-2878
    Keywords: optimization ; statistical models ; convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Algorithms based on statistical models compete favorably with other global optimization algorithms as shown by extensive testing results. A theoretical inadequacy of previously used statistical models for smooth objective functions was eliminated by the authors who, in a recent paper, have constructed a P-algorithm for a statistical model for smooth functions. In the present paper, a modification of that P-algorithm with an improved convergence rate is described.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 253-264 
    ISSN: 1573-2878
    Keywords: Geometric programs ; optimization ; generalized reduced gradient method ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes the performance of a general-purpose GRG code for nonlinear programming in solving geometric programs. The main conclusions drawn from the experiments reported are: (i) GRG competes well with special-purpose geometric programming codes in solving geometric programs; and (ii) standard time, as defined by Colville, is an inadequate means of compensating for different computing environments while comparing optimization algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 143-149 
    ISSN: 1573-2878
    Keywords: Laguerre polynomials ; variational problems ; Ritz direct method ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A direct method for solving variational problems via Laguerre series is presented. First, an operational matrix for the integration of Laguerre polynomials is introduced. The variational problems are reduced to the solution of algebraic equations. An illustrative example is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 73 (1992), S. 299-307 
    ISSN: 1573-2878
    Keywords: Variable metric methods ; variationally derived scaling ; preconvex part of the Broyden family ; optimization ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper is devoted to a general variational approach for scaling the variable metric updates. A new method from the preconvex part of the Broyden family is given which minimizes not only the generalized Frobenius norm but also the condition number of the update. The computational efficiency of this method, with both preliminary and controlled scaling strategy, is demonstrated on sufficiently difficult test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 63 (1989), S. 309-332 
    ISSN: 1573-2878
    Keywords: Dynamic ship positioning ; Kalman filtering ; optimization ; linear optimal control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The design of a dynamic positioning system for a multiplymoored vessel with active winches and thrusters is presented. The proposed positioning system is based on the Kalman filter and linear optimal control. Its peculiarity is that it contains a scheme which allocates dynamically the control forces between moorings and thrusters. The allocation policy tries to minimize the energy of the control by maintaining the average propeller thrust near to zero. The efficacy of the scheme is illustrated by numerical simulations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 549-574 
    ISSN: 1573-2878
    Keywords: Boundary control ; wave and plate equations ; optimization ; nonstandard Riccati equations ; input dynamics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An optimization problem for a control system governed by an analytic generator with unbounded control actions is considered. The solution to this problem is synthesized in terms of the Riccati operator, arising from a nonstandard Riccati equation. Solvability and uniqueness of the solutions to this Riccati equation are established. This theory is applied to a boundary control problem governed by damped wave and plate equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 86 (1995), S. 199-222 
    ISSN: 1573-2878
    Keywords: Routing ; optimization ; queueing systems ; robustness ; distributed algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 91 (1996), S. 695-728 
    ISSN: 1573-2878
    Keywords: Structural acoustics ; unbounded control input ; coupled wave and beam equations ; hyperbolic and parabolic-like dynamics ; trace regularity ; optimization ; Riccati equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we provide results concerning the optimal feedback control of a system of partial differential equations which arises within the context of modeling a particular fluid/structure interaction seen in structural acoustics, this application being the primary motivation for our work. This system consists of two coupled PDEs exhibiting hyperbolic and parabolic characteristics, respectively, with the control action being modeled by a highly unbounded operator. We rigorously justify an optimal control theory for this class of problems and further characterize the optimal control through a suitable Riccati equation. This is achieved in part by exploiting recent techniques in the area of optimization of analytic systems with unbounded inputs, along with a local microanalysis of the hyperbolic part of the dynamics, an analysis which considers the propagation of singularities and optimal trace behavior of the solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Water, air & soil pollution 117 (2000), S. 61-81 
    ISSN: 1573-2932
    Keywords: air stripping ; gas phase activated carbon adsorption ; multicomponent ; off-gas control ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: Abstract A computer based system, Best Available Technology Evaluator (BATE), has been developed for the evaluating cost and performance of the best available technologies for removing volatile organic chemicals (VOCs) from drinking water. The treatment processes considered are air stripping tower (AST), and air stripping with off-gas control by gas phase granular activated carbon (GPGAC) and liquid phase granular activated carbon (LPGAC). BATE is unique in its ability to model multicomponents, optimise total cost for different process configurations and yield the best process design for a given VOC scenario. This paper, the first in a two-part series, highlights a new cost optimization method for the AST with GPGAC system and a technique for combining mathematical models for efficient process design of AST and GPGAC processes. Discussion of LPGAC simulation results and comparison of an LPGAC system with AST and GPGAC processes for a variety of VOC scenarios will follow in the next paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 51 (2000), S. 341-352 
    ISSN: 1432-5217
    Keywords: Key words: Stable ditributions ; portfolio management ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. The aim of this short review is to outline the main directions of stable Paretian modeling in portfolio management.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 32 (1988), S. 271-297 
    ISSN: 1432-5217
    Keywords: Quadratic programming ; optimization ; conjugate directions ; decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Unter Benutzung von konjungierten Richtungen wird eine Methode zur Lösung von konvexen, quadratischen Optimierungsproblemen entwickelt. Der Algorithmus erzeugt eine Folge von zulässigen Lösungen und endet nach einer endlichen Anzahl von Iterationen. Erweiterungen des Algorithmus für nichtkonvexe und für große strukturierte quadratische Optimierungsprobleme werden diskutiert.
    Notes: Abstract By using conjugate directions a method for solving convex quadratic programming problems is developed. The algorithm generates a sequence of feasible solutions and terminates after a finite number of iterations. Extensions of the algorithm for nonconvex and large structured quadratic programming problems are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 51 (2000), S. 315-339 
    ISSN: 1432-5217
    Keywords: Key words: Incomplete market ; quadratic hedging ; optimization ; semimartingales ; stochastic integrals ; Kunita-Watanabe projection ; L2-projection ; minimal martingale measure ; variance-optimal martingale measure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. We review the main results in the theory of quadratic hedging in a general incomplete model of continuous trading with semimartingale price process. The objective is to hedge contingent claims by using portfolio strategies. We describe two types of criteria: the so-called (local) risk-minimization and the mean-variance approaches. From a mathematical viewpoint, these optimization problems lead to new variants of decomposition theorems in stochastic analysis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 13 (1992), S. 669-674 
    ISSN: 1573-2754
    Keywords: mathematical programming ; optimization ; dynamics of systems of rigid bodies ; ski jumping
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract This paper is based on the finite and dispersed data which were obtained from the experiments of the wind tunnel and of the force measurement and from the high-speed photography. It analyses and optimizes the take-off movement of ski jumping with the theory of dynamics of systems of rigid bodies and with the method of mathematical programming. The paper describes the optimal take-off movement of ski jumping. Furthermore, it presents an example and compares the result with those of other papers published at home and abroad. The comparison shows that our computation and optimization are reasonable and well-grounded.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 14 (1993), S. 887-889 
    ISSN: 1573-2754
    Keywords: Stokes wave ; limiting wave ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract In this paper we extend the method developed in [1] for limiting Stokes wave of infinite water depth to cover the case of finite depth. The method has high efficiency and the result is accurate.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 21 (2000), S. 19-26 
    ISSN: 1573-2754
    Keywords: structure ; optimization ; topology optimization ; modeling ; dual programming ; O223 ; TU323
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract Topology optimization design of continuum structures that can take account of stress and displacement constraints simultaneously is difficult to solve at present. The main obstacle lies in that, the explicit function expressions between topological variables and stress or displacement constraints can not be obtained using homogenization method or variable density method. Furthermore, large quantities of design variables in the problem make it hard to deal with by the formal mathematical programming approach. In this paper, a smooth model of topology optimization for continuum structures is established which has weight objective considering stress and displacement constraints based on the independent-continuous topological variable concept and mapping transformation method proposed by Sui Yunkang and Yang Deqing. Moreover, the approximate, explicit expressions are given between topological variables and stress or displacement constraints. The problem is well solved by using dual programming approach, and the proposed element deletion criterion implements the inversion of topology variables from the discrete to the continuous. Numerical examples verify the validity of proposed method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 279-291 
    ISSN: 1573-2878
    Keywords: Banach spaces ; optimization ; dual cone ; regular cone of decrease ; local closed cone
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This article is devoted to constrained minimization problems in Banach space. A necessary condition is derived and is compared with other similar results. In the process, correlation of some of the existing results is established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 23 (1977), S. 101-109 
    ISSN: 1573-2878
    Keywords: Operations research ; optimization ; allocation ; location-allocation ; existence ; uniqueness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Some mathematical aspects are studied for a wide class of problems called continuous allocation problems: Find a mapping, from one given continuous set onto another, to minimize a given function on these sets. Many problems of assortments, catalogs, scheduling, location-allocation, search, etc., fall in this class. Theorems on existence, uniqueness, and continuity of solution are given. A solution technique is given for then-dimensional generalized location-allocation problem, and it is shown to converge on a solution. Finally, an expression is found for the facility density in multiple-facility location-allocation problems when the range of the mapping is continuous (as the number of facilities tends to infinity).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 299-307 
    ISSN: 1573-2878
    Keywords: Shifted Legendre polynomials ; operational matrix ; variational problems ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The shifted Legendre polynomial series is employed to solve variational problems. The solution is carried out by using an operational matrix for integrating the shifted Legendre polynomial vector. Variational problems are reduced to solving algebraic equations. Two illustrative examples are given, and the computational results obtained by Legendre series direct method are compared with the exact solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 487-496 
    ISSN: 1573-2878
    Keywords: System identification ; optimal inputs ; parameter estimation ; two-point boundary-value problems ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A recent paper by Mehra has considered the design of optimal inputs for linear system identification. The method proposed involves the solution of homogeneous linear differential equations with homogeneous boundary conditions. In this paper, a method of solution is considered for similar-type problems with nonhomogeneous boundary conditions. The methods of solution are compared for the homogeneous and nonhomogeneous cases, and it is shown that, for a simple numerical example, the optimal input for the nonhomogeneous case is almost identical to the homogeneous optimal input when the former has a small initial condition, terminal time near the critical length, and energy input the same as for the homogeneous case. Thus tentatively, solving the nonhomogeneous problem appears to offer an attractive alternative to solving Mehra's homogeneous problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 59 (1988), S. 39-43 
    ISSN: 1573-2878
    Keywords: Nonlinear algebraic equations ; conjugate direction methods ; optimization ; projection algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, it is shown that, when two subclasses of algorithms in the ABSg family are applied to a set of nonlinear algebraic equations, then the convergence is superlinear. The conditions for the theorem to be true are essentially the same as those that apply to the Newton method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 72 (1992), S. 37-63 
    ISSN: 1573-2878
    Keywords: Nonlinear programming ; convex programming ; gradient projections ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper gives a proof of convergence of an iterative method for maximizing a concave function subject to inequality constraints involving convex functions. The linear programming problem is an important special case. The primary feature is that each iteration is very simple computationally, involving only one of the constraints. Although the paper is theoretical in nature, some numerical results are included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 74 (1992), S. 457-468 
    ISSN: 1573-2878
    Keywords: Quasiconcave functions ; upper level sets ; optimization ; geometric characterization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Quasiconcave functions are characterized by the convexity of the upper level sets. This paper presents the additional properties which are required to characterize explicitly quasiconcave functions, which include the strictly quasiconcave functions. These additional properties are expressed in terms of the properties of and relationships between the level set, the upper level set, the boundary, and the profile of the upper level set.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 75 (1992), S. 587-602 
    ISSN: 1573-2878
    Keywords: Probabilistic constrained problems ; chance-constrained problems ; linear programming ; duality ; optimization ; convex analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present two pairs of dually related probabilistic constrained problems as extensions of the linear programming duality concept. In the first pair, a bilinear function appears in the objectives and each objective directly depends on the feasibility set of the other problem, as in the game theoretical formulation of dual linear programs. In the second pair, we reformulate the objectives and eliminate their direct dependence on the feasibility set of the other problem. We develop conditions under which the dually related problems have no duality gap and conditions under which the two pairs of problems are equivalent as far as their optimality sets are concerned.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 339-360 
    ISSN: 1573-2878
    Keywords: Approximations ; algorithmic convergence ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In an earlier paper, the authors introduced epigraphical nesting of objective functions as a means to characterize the convergence of global optimization algorithms. Epigraphical nesting of objective functions may be looked upon as a relaxation of epigraphical convergence of objective functions, whereby one ensures that epigraphs of the approximations contain asymptotically the epigraph of the objective function of the original optimization problem. In this paper, we show that, for algorithms which seek only a stationary point, convergence can be assured by objective function approximations whose directional derivatives attain an epigraphical nesting property. We demonstrate that epigraphical nesting provides a unifying thread that ties together a number of different algorithms, including those for the solution of variational inequalities and smooth as well as nonsmooth optimization. We show that the Newton method and its variants for unconstrained optimization, successive quadratic programming methods for constrained optimization, and proximal point algorithms (deterministic and stochastic) all construct approximations in which the directional derivatives attain an epigraphical nesting property, even though the approximations themselves fail to attain such a property.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 705-726 
    ISSN: 1573-2878
    Keywords: Nonlinear allocation problems ; networks ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem considered is as follows:m resources are to be allocated ton activities, with resourcei contributing linearly to the potential for activityj according to the coefficientE(i,j). The objective is to minimize some nonlinear function of the potentials. If the objective function is sufficiently well behaved, the problem can be solved in finitely many steps using the method described in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 597-607 
    ISSN: 1573-2878
    Keywords: Optimal control ; gradient flows ; optimization ; decentralized systems ; performance index
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the problem of computing the suboptimal output feedback gains of decentralized control systems is investigated. First, the problem is formulated. Then, the gradient matrices based on the index function are derived and a new algorithm is established based on some nice properties. This algorithm shows that a suboptimal gain can be computed by solving several ordinary differential equations (ODEs). In order to find an initial condition for the ODEs, an algorithm for finding a stabilizing output feedback gain is exploited, and the convergence of this algorithm is discussed. Finally, an example is given to illustrate the proposed algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 95 (1997), S. 467-499 
    ISSN: 1573-2878
    Keywords: Flight mechanics ; astrodynamics ; celestial mechanics ; Earth-to-Mars missions ; departure window ; arrival window ; optimization ; sequential gradient-restoration algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with the optimal transfer of a spacecraft from a low Earth orbit (LEO) to a low Mars orbit (LMO). The transfer problem is formulated via a restricted four-body model in that the spacecraft is considered subject to the gravitational fields of Earth, Mars, and Sun along the entire trajectory. This is done to achieve increased accuracy with respect to the method of patched conics. The optimal transfer problem is solved via the sequential gradient-restoration algorithm employed in conjunction with a variable-stepsize integration technique to overcome numerical difficulties due to large changes in the gravitational field near Earth and near Mars. The optimization criterion is the total characteristic velocity, namely, the sum of the velocity impulses at LEO and LMO. The major parameters are four: velocity impulse at launch, spacecraft vs. Earth phase angle at launch, planetary Mars/Earth phase angle difference at launch, and transfer time. These parameters must be determined so that ΔV is minimized subject to tangential departure from circular velocity at LEO and tangential arrival to circular velocity at LMO. For given LEO and LMO radii, a departure window can be generated by changing the planetary Mars/Earth phase angle difference at launch, hence changing the departure date, and then reoptimizing the transfer. This results in a one-parameter family of suboptimal transfers, characterized by large variations of the spacecraft vs. Earth phase angle at launch, but relatively small variations in transfer time and total characteristic velocity. For given LEO radius, an arrival window can be generated by changing the LMO radius and then recomputing the optimal transfer. This leads to a one-parameter family of optimal transfers, characterized by small variations of launch conditions, transfer time, and total characteristic velocity, a result which has important guidance implications. Among the members of the above one-parameter family, there is an optimum–optimorum trajectory with the smallest characteristic velocity. This occurs when the radius of the Mars orbit is such that the associated period is slightly less than one-half Mars day.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 99 (1998), S. 303-330 
    ISSN: 1573-2878
    Keywords: Stability robustness bounds ; optimization ; reduced conservatism bounds ; discrete-time systems ; robust control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, existing stability robustness measures for the perturbation of both continuous-time and discrete-time systems are reviewed. Optimized robustness bounds for discrete-time systems are derived. These optimized bounds are obtained reducing the conservatism of existing bounds by (a) using the structural information on the perturbation and (b) changing the system coordinates via a properly chosen similarity transformation matrix. Numerical examples are used to illustrate the proposed reduced conservatism bounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Journal of combinatorial optimization 4 (2000), S. 7-33 
    ISSN: 1573-2886
    Keywords: dispersion ; storage capacity ; storage cost ; optimization ; polynomial algorithm ; approximation scheme
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The MAX-MIN dispersion problem, which arises in the placement of undesirable facilities, involves selecting a specified number of sites among a set of potential sites so as to maximize the minimum distance between any pair of selected sites. We consider different versions of this dispersion problem where each potential site has an associated storage capacity and a storage cost. A typical problem in this context is to choose a subset of potential sites so that the total capacity of the chosen sites is at least a given value, the total storage cost is within the specified budget and the minimum distance between any pair of chosen sites is maximized. Since these constrained optimization problems are NP-hard in general, we consider whether there are efficient approximation algorithms for them with good performance guarantees. Our results include approximation algorithms for some versions, approximation schemes for some geometric versions and polynomial algorithms for special cases. We also present results that bring out the intrinsic difficulty of obtaining near-optimal solutions to some versions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 3 (1993), S. 377-391 
    ISSN: 1573-2916
    Keywords: Branch-and-bound ; cutting plane ; decomposition ; convex-concave function ; global ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We propose unified branch-and-bound and cutting plane algorithms for global minimization of a functionf(x, y) over a certain closed set. By formulating the problem in terms of two groups of variables and two groups of constraints we obtain new relaxation bounding and adaptive branching operations. The branching operation takes place in y-space only and uses the iteration points obtained through the bounding operation. The cutting is performed in parallel with the branch-and-bound procedure. The method can be applied implementably for a certain class of nonconvex programming problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 100 (1999), S. 145-160 
    ISSN: 1573-2878
    Keywords: Nonlinear least squares ; optimization ; regularization ; KKT conditions ; rank-deficient nonlinear constraints ; rank-deficient nonlinear least-square problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In nonlinear least-square problems with nonlinear constraints, the function $$\left. {(1/2)} \right\|\left. {f_2 (x)} \right\|_2^2$$ , where f 2 is a nonlinear vector function, is to be minimized subject to the nonlinear constraints f 1(x)=0. This problem is ill-posed if the first-order KKT conditions do not define a locally unique solution. We show that the problem is ill-posed if either the Jacobian of f 1 or the Jacobian of J is rank-deficient (i.e., not of full rank) in a neighborhood of a solution satisfying the first-order KKT conditions. Either of these ill-posed cases makes it impossible to use a standard Gauss–Newton method. Therefore, we formulate a constrained least-norm problem that can be used when either of these ill-posed cases occur. By using the constant-rank theorem, we derive the necessary and sufficient conditions for a local minimum of this minimum-norm problem. The results given here are crucial for deriving methods solving the rank-deficient problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 403-416 
    ISSN: 1573-2878
    Keywords: Liapunov function ; reachability ; optimization ; quantitative control ; qualitative control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we find sufficient conditions that do not rely upon any Liapunov stability results for the reachability of the target set by an admissible control from ana priori specified set of states. The conditions found are less restrictive than those obtained by Sticht, Vincent, and Schultz in Ref. 1. For control problems with specific integral performance index, we also show that, if a quantitative Liapunov function for optimization exists, then it may also serve as a qualitative Liapunov function ensuring the reachability of the target. The results are illustrated by examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 45 (1985), S. 101-112 
    ISSN: 1573-2878
    Keywords: Delay systems ; optimization ; block pulse functions ; linear systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The concept of coefficient shift matrix is introduced to represent delay variables in block pulse series. The optimal control of a linear delay system with quadratic performance index is then studied via block pulse functions, which convert the problems into the minimization of a quadratic form with linear algebraic equation constraints. The solution of the two-point boundary-value problem with both delay and advanced arguments is circumvented. The control variable obtained is piecewise constant.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 55 (1987), S. 377-390 
    ISSN: 1573-2878
    Keywords: Stochastic programming ; probabilistic constrained problems ; chance constrained problems ; duality ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the two problems inf{inf{cx:x ∈R n,A 1 x≥y,A 2 x≥b}:y ∈ suppF ⊂R m,F(y)≥p} and sup{inf{uy:y ∈ suppF ⊂R m,F(y)≥p}+vb:uA 1+vA 2=c, (u,v≥0} are investigated, whereA 1,A 2,b,c are given matrices and vectors of finite dimension,F is the joint probability distribution of the random variables β1,...,β m, and 0〈p〈1. The first problem was introduced as the deterministic equivalent and the second problem was introduced as the dual of the probabilistic constrained linear programming problem inf{cx:P(A 1 x≥β)≥p,A 2 x≥b}.b}. Properties of the sets and the functions involved in the two problems and regularity conditions of optimality are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 49 (1986), S. 289-317 
    ISSN: 1573-2878
    Keywords: Control theory ; disturbances ; stochastic processes ; production and inventory smoothing ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A comprehensible and unified system control approach is presented to solve a class of production/inventory smoothing problems. A nonstationary, non-Gaussian, finite-time linear optimal solution with an attractive computation scheme is obtained for a general quadratic and linear cost structure. A complete solution to a classical production/inventory control problem is given as an example. A general solution to the discrete-time optimal regulator with arbitrary but known disturbance is provided and discussed in detail. A computationally attractive closed-loop suboptimal scheme is presented for problems with constraints or nonquadratic costs. Implementation and interpretation of the results are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 62 (1989), S. 139-150 
    ISSN: 1573-2878
    Keywords: Optimality conditions ; value function ; mathematical programming ; generalized gradients ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The B-gradients are a convex set of generalized gradients contained in Clarke's generalized gradients. These gradients retain many of the nice properties of Clarke's generalized gradients. In this paper, necessary conditions for optimality in finite-dimensional perturbed optimization problems are given. A calmness condition is used for a constraint qualification.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 62 (1989), S. 405-417 
    ISSN: 1573-2878
    Keywords: Robust stability ; robustness ; optimization ; uncertain systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the problem of robustness bounds of Hurwitz and Schur polynomials is addressed. For weightedL 2-norm perturbations of a Hurwitz polynomialp(s) or a Schur polynomialp(z), a new method is developed for calculating the maximal perturbation bound under which stability is preserved. We show that such a robustness bound is related to the minimum of a rational function. The new method is superior to the previous one developed by Soh, Berger, and Dabke in Ref. 1. Our approach also provides solutions for the perturbation polynomial δp(s) or δp(z) with minimal coefficient norm which causep(s)+δp(s) orp(z)+δp(z) to be unstable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 75 (1992), S. 101-132 
    ISSN: 1573-2878
    Keywords: Diffusion equation ; optimal control ; Radon measures ; optimization ; linear programming ; moment problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The present paper is concerned with an optimal control problem for then-dimensional diffusion equation with a sequence of Radon measures as generalized control variables. Suppose that a desired final state is not reachable. We enlarge the set of admissible controls and provide a solution to the corresponding moment problem for the diffusion equation, so that the previously chosen desired final state is actually reachable by the action of a generalized control. Then, we minimize an objective function in this extended space, which can be characterized as consisting of infinite sequences of Radon measures which satisfy some constraints. Then, we approximate the action of the optimal sequence by that of a control, and finally develop numerical methods to estimate these nearly optimal controls. Several numerical examples are presented to illustrate these ideas.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 77 (1993), S. 257-290 
    ISSN: 1573-2878
    Keywords: Routing ; optimization ; queueing systems ; robustness ; distributed algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the effect of model uncertainties on optimal routing in a system of parallel queues. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity, the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using on-line gradient estimation is also included and its performance compared with that of model-based algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 78 (1993), S. 553-578 
    ISSN: 1573-2878
    Keywords: Analytic disks ; optimization ; H ∞-control ; higher-order Newton methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present algorithms for solving general sup-norm minimization problems over spaces of analytic functions, such as those arising inH ∞ control. We also give an analysis and some theory of these algorithms. Part of this is specific to analytic optimization, while part holds for general sup-norm optimization. In particular, we are proposing a type of Newton-type algorithm which actually uses very high-order terms. The novel feature is that higher-order terms can be chosen in many ways while still maintaining a second-order convergence rate. Then, a clever choice of higher-order terms greatly reduces computation time. Conceivably this technique can be modified to accelerate Newton algorithms in some other circumstances. Estimates of order of convergence as well as results of numerical tests are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 68 (1991), S. 161-179 
    ISSN: 1573-2878
    Keywords: Hydraulic systems ; nonlinear systems ; optimization ; decomposition ; simulators
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A theory for the optimization of nonlinear hydraulic systems is presented. The problem has been solved in spite of the nonlinear system model and the mixed-integer nature of the decision variables. The optimization problem is formulated in terms of the time-distribution-function concept. This leads to a numerically efficient two-level algorithm. No specific control model is needed: the algorithm employs a system simulator. The general approach is also applicable to other nonlinear systems. The paper concludes with a practical application, together with numerical results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 12 (1998), S. 157-174 
    ISSN: 1573-2916
    Keywords: Multiple criteria decision aid ; sorting problem ; ELECTRE TRI method ; parameters' elicitation ; inference procedure ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Given a finite set of alternatives, the sorting problem consists in the assignment of each alternative to one of the pre-defined categories. In this paper, we are interested in multiple criteria sorting problems and, more precisely, in the existing method ELECTRE TRI. This method requires the elicitation of parameters (weights, thresholds, category limits,...) in order to construct the Decision Maker's (DM) preference model. A direct elicitation of these parameters being rather difficult, we proceed to solve this problem in a way that requires from the DM much less cognitive effort. We elicit these parameters indirectly using holistic information given by the DM through assignment examples. We propose an interactive approach that infers the parameters of an ELECTRE TRI model from assignment examples. The determination of an ELECTRE TRI model that best restitutes the assignment examples is formulated through an optimization problem. The interactive aspect of this approach lies in the possibility given to the DM to revise his/her assignment examples and/or to give additional information before the optimization phase restarts.
    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...