All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 8 Next

Displaying 141 – 160 of 448

Showing per page

Differential evolution algorithm combined with chaotic pattern search

Yaoyao He, Jianzhong Zhou, Ning Lu, Hui Qin, Youlin Lu (2010)

Kybernetika

Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional space....

Duality theorems for a class of non-linear programming problems.

Shyam S. Chadha (1988)

Trabajos de Investigación Operativa

Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.

Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints

Truong Q. Bao, Boris S. Mordukhovich (2007)

Applications of Mathematics

In this paper we study set-valued optimization problems with equilibrium constraints (SOPECs) described by parametric generalized equations in the form 0 ∈ G ( x ) + Q ( x ) , where both G and Q are set-valued mappings between infinite-dimensional spaces. Such models particularly arise from certain optimization-related problems governed by set-valued variational inequalities and first-order optimality conditions in nondifferentiable programming. We establish general results on the existence of optimal solutions under...

Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems

Majeed Heydari, Mohammad Kazem Sayadi, Kamran Shahanaghi (2010)

RAIRO - Operations Research

The VIKOR method was introduced as a Multi-Attribute Decision Making (MADM) method to solve discrete decision-making problems with incommensurable and conflicting criteria. This method focuses on ranking and selecting from a set of alternatives based on the particular measure of “closeness” to the “ideal” solution. The multi-criteria measure for compromise ranking is developed from the l–p metric used as an aggregating function in a compromise programming method. In this paper, the VIKOR method...

Currently displaying 141 – 160 of 448