<Para ID="Par1">The mesh adaptive direct search (<Emphasis Type="SmallCaps">Mads) algorithm is designed for blackbox optimization problems subject to general inequality constraints. Currently, <Emphasis Type="SmallCaps">Mads does not support equalities, neither in theory nor in practice. The present work proposes extensions to treat problems with linear equalities...</emphasis></emphasis></para>

The pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given...

We examine the example of a multinational corporation that attempts to maximize its global after tax profits by determining the flow of goods, the transfer prices, and the transportation cost allocation between each of its subsidiaries. Vidal and Goetschalckx [Vidal, C.J., Goetschalckx, M.,...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the...

The paper answers the three distinct questions of maximizing the perimeter, diameter and area of equilateral unit-width convex polygons. The solution to each of these problems is trivially unbounded when the number of sides is even. We show that when this number is odd, the optimal solution to...

This work studies multiobjective optimization (MOP) of nonsmooth functions subject to general constraints. We first present definitions and optimality conditions as well as some single-objective formulations of MOP, parameterized with respect to some reference point in the space of objective...