Ingénierie (conception en ingénierie, conception numérique)
RetourCahiers du GERAD
225 résultats — page 10 de 12
We propose a unified framework for the update of the barrier parameter in interiorpoint methods for nonlinear programming. The original primal-dual system i...
référence BibTeX
Usual graph classes, such as complete graphs, paths, cycles and stars, frequently appear as extremal graphs in graph theory problems. Here we want to turn t...
référence BibTeX
Most examples of cycling in the simplex method are given without explanation of how they were constructed. An exception is Beale’s 1955 example built around...
référence BibTeX
Several upper bounds on the largest Laplacian eigenvalue of a graph <i>G</i>, in terms of degree and average degree of neighbors of its vertices, have been ...
référence BibTeX
The objectives of this paper are twofold; we first demonstrate the flexibility of the mesh adaptive direct search (MADS) in identifying locally optimal algo...
référence BibTeX
Les problèmes de chargement statique de groupes turbo-alternateurs à vapeur peuvent être exprimés sous forme de minimisation d’une somme de fonction de coût ...
référence BibTeX
Dynamic programming is applied to the economic dispatch problem with spin- ning reserve constraint. A first algorithm, based on a direct application of Bell...
référence BibTeX
In this paper, we examine the sensitivity of trust-region algorithms on the param- eters related to the step acceptance and update of the trust region. We s...
référence BibTeX
Recent developments in numerical methods for solving large differentiable nonlinear optimization problems are reviewed. State-of-the-art algorithms for solv...
référence BibTeX
<p> This paper introduces the Mesh Adaptive Direct Search (MADS) class of algorithms for nonlinear optimization. MADS extends the Generalized Pattern Searc...
référence BibTeX
Chemical graphs, as other ones, are <i>regular</i> if all their vertices have the same degree. Otherwise, they are <i>irregular</i> and it is of interest to...
référence BibTeX
A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-De...
référence BibTeX
This paper formulates and analyzes a pattern search method for general constrained optimization based on filter methods for step acceptance. Roughly, a f...
référence BibTeX
Cet article propose un modèle d’optimisation des stratégies de maintenance pour une meilleure intégration dans un plan de production préétabli. Le modèle est...
référence BibTeX
We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...
référence BibTeXTypologie des réseaux de manutention
La majorité des auteurs traitant du problème de design d'implantation d'usine considèrent que la sélection de la configuration du réseau de manutention est f...
référence BibTeX
Generalized logical analysis aims at modelling complex biological systems, especially the so-called regulatory systems like genetic networks. The main feat...
référence BibTeX
The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...
référence BibTeX
A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses th...
référence BibTeX
This paper describes a method for evaluating the kinetic constants in a rate expression for catalytic combustion applications using experimental light-off c...
référence BibTeX