Ingénierie (conception en ingénierie, conception numérique)

Retour

Cahiers du GERAD

241 résultats — page 10 de 13

, , et

The purpose of this paper is to introduce a new way of choosing directions for the Mesh Adaptive Direct Search (MADS) class of algorithms. The advantages of...

référence BibTeX
, et

We describe LANCELOT_simple, an interface to the LANCELOT B nonlinear optimization package within the GALAHAD library (Gould, Orban and Toint, 2003) which ig...

référence BibTeX
, et

Storage location assignment and interleaving policy are two closely related problems in warehousing management. This paper addresses the location assignmen...

référence BibTeX
, , , et

In this paper, we examine sets of tools associated to modeling systems for mathematical programming which can be used to automatically detect the presence ...

référence BibTeX
, et

We propose a new approach to solve the multi-objective portfolio selection problem in the presence of skewness. The selection of efficient portfolios require...

référence BibTeX
, et

This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern ...

référence BibTeX

We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in ...

référence BibTeX
, , et

In previous work, the generalized pattern search (GPS) algorithm for linearly constrained (continuous) optimization was extended to mixed variable problems...

référence BibTeX
et

We propose a new algorithm for general constrained derivative-free optimization. As in most methods, constraint violations are aggregated into a single con...

référence BibTeX
, et

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with th...

référence BibTeX
et

Optimization problems modeled in the AMPL modeling language [Fourer, Gay and Kernighan (2002)] may be examined by a set of tools found in the AMPL Library [...

référence BibTeX
, et

This work deals with bound constrained multiobjective optimization (<i>MOP</i>) of nonsmooth functions for problems in which the structure of the objective ...

référence BibTeX
, et

In this paper, the general problem of chemical process optimization defined by a computer simulation is formulated. It is generally a nonlinear, non-convex,...

référence BibTeX
, et

Past studies have shown the unstability of unstructured peer-to-peer networks, in particular Gnutella. Because of this unstability, queries in these network...

référence BibTeX
et

<p>Using the <i>AutoGraphiX 2</i> system, a systematic study is made on generation and proof of relations of the form</p> <center> $\underline{b}_n \leq ...

référence BibTeX
, et

This paper is intended not as a survey, but as an introduction to some ideas behind the class of mesh adaptive direct search (MADS) methods. Space limitatio...

référence BibTeX
, et

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
et

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
, et

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
, et

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