Minimizing a function of order p using a genetic algorithm
Keywords:
Genetic algorithms, nonlinear programming, order value optimizationAbstract
In this work we consider the problem OVO (order value optimization), where m given continuous functions f1; :::; fm, defined on a domain 2 Rn and an integer p 2 f1; :::;mg, the function of order p with p m, is given by f(x) = fip(x)(x), for all x 2 , where ip(x) is a function satisfying fi1(x)(x) fi2(x)(x) ::: fip(x)(x) ::: fim(x)(x): The problem we address is to minimize f with x 2 by a genetic algorithm that by its very nature has the advantage over existing continuous optimization methods, to find global minimizers. We illustrate the application of this algorithm on examples considered showing its efectiveness in solving them.
Downloads
Downloads
Published
Issue
Section
License
The opinions expressed by the authors do not necessarily reflect the position of the publisher of the publication or of UCLA. The total or partial reproduction of the texts published here is authorized, as long as the complete source and the electronic address of this journal are cited.
The authors fully retain the rights to their works, giving the journal the right to be the first publication where the article is presented. The authors have the right to use their articles for any purpose as long as it is done for non-profit. Authors are recommended to disseminate their articles in the final version, after publication in this journal, in the electronic media of the institutions to which they are affiliated or personal digital media.
