Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 6 of 69
In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated in...
BibTeX referenceA derivative-free approach to optimal control problems with a piecewise constant Mayer cost function
A piecewise constant Mayer cost function is used to model optimal control problems in which the state space is partitioned into several regions, each having ...
BibTeX reference
The use of space through satellites is more and more important for nations, companies, and individuals. However, since the first satellite was sent up in 19...
BibTeX reference
This paper presents an efficient method for extracting the second-order sensitivities from a system of implicit nonlinear equations. We design a custom aut...
BibTeX reference
For a simple connected graph \(G\)
, let \(D(G), ~Tr(G)\)
, \(D^{L}(G)=Tr(G)-D(G)\)
, and \(D^{Q}(G)=Tr(G)+D(G)\)
be the distance matrix, the diagonal m...
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with \(n=2m\)
vertices is not known when \(m \ge 7\)
. In this paper, w...
The Tenth Montreal IPSW took place on August 13-27, 2020, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute for Dat...
BibTeX reference
For a graph \(G\)
, the signless Laplacian matrix \(Q(G)\)
defined as \(Q(G) = D(G) + A(G)\)
, where \(A(G)\)
is the adjacency matrix of \(G\)
and `...
In this paper we examine the stability of international environmental agreements about a (common) emissions target. By signing the agreement, the parties d...
BibTeX reference
The increasingly complex energy systems are turning the attention towards model-free control approaches such as reinforcement learning (RL). This work propos...
BibTeX reference
A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with \(n=2^s\)
vertices is not known when \(s \ge 3\)
. T...
Binary quadratic programming (BQP) is a class of combinatorial optimization problems comprising binary variables, quadratic objective functions and linear/no...
BibTeX referenceAdaptive simultaneous stochastic optimization of mining complexes: Where is the value coming from?
This paper aims to identify the sources of value created in the strategic plan of a mining complex when the adaptive simultaneous stochastic optimization of ...
BibTeX reference
The geometallurgical models that predicting the throughput/comminution performance of the a processing plant often rely on rock hardness models, which are ba...
BibTeX reference
In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-orde...
BibTeX reference
This work is in the context of blackbox optimization where the functions defining the problem are expensive to evaluate and where no derivatives are availabl...
BibTeX reference
We study a class of deterministic finite-horizon two-player nonzero-sum differential games where players are endowed with different kinds of controls. W...
BibTeX referenceBlackbox optimization
The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that sh...
BibTeX referenceIntegrating learning and explicit model predictive control for unit commitment in microgrids
In this paper, we apply flexibility-based operational planning method to microgrid (MG) unit commitment (UC). The problem is formulated based on model predi...
BibTeX reference
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \(n=2^s\)
vertices is not known when `(s ...