1,720,977 research outputs found
Ontwerp en implementatie van een interface-programma voor het oplossen van niet-lineaire optimaliseringsproblemen met NONLINMIN op een personal computer
No full textHet oplossen van minimaliseringsproblemen met beperkingen met behulp van sequentieel kwadratisch programmeren
No full text
The turning point problem : an example of the optimization of quasi-stationary sailplane trajectories by means of convex combinations
No full textQuasi-stationary sailplane trajectory problems are relatively simple, practical nonlinear optimization problems which for educational reasons will be of interest to a much larger audience than the sailplane pilot community alone. One interesting problem is the turning point problem which concerns the determination of the optimal velocities with which the sailplane pilot should fly when he wants to optimally round a turning point on a return or on a triangle flight in the presence of wind. This problem lends itself very well for solution by the convex-combinations approach discussed by the author in a number of recent papers dealing with other sailplane trajectory problems. This convex-combinations approach is a purely geometric approach that is based on an interesting relation between the average velocity over a broken trajectory and a certain convex combination of the vectors representing the velocities over the different legs of the trajectory. In the paper first the basic ideas governing quasi-stationary sailplane trajectory optimization problems as well as the convex-combinations approach are reviewed. Then the solution is derived of the turning point problem by means of this convex-combinations approach. With the help of a special graph, the turning point graph, introduced in the paper, this solution may be easily implemented in flight. This turning point graph may be constructed by graphical means by any sailplane pilot without too much trouble.
Keywords: Aerospace trajectories, nonlinear optimizatio
De numerieke oplossing van gediscretiseerde optimale-besturingsproblemen met behulp van sequentiele kwadratische programmering
No full text
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Uitbreiding en verfijning van de Algol-procedure NONLINMIN voor het minimaliseren van niet-lineaire functies onder niet-lineaire nevenvoorwaarden
No full textDe numerieke oplossing van niet-lineaire optimaliseringsproblemen met nevenvoorwaarden met behulp van recursief kwadratisch programmeren
No full text- …
