Data Envelopment Analysis (DEA) has been widely studied in the literature since its inception in 1978. The methodology behind the classical DEA, the oriented method, is to hold inputs (outputs) constant and to determine how much of an improvement in the output (input) dimensions is necessary in...

The world is dependent on oil, as economy relies on a constant oil supply. Therefore, other markets seem to be influenced by the oil market. Recent developments in timber prices – for example, rising fuelwood prices – as well as shifts in supply and demand on the timber markets are an...

To efficiently operate electromechanical systems powered by two energy sources, it is necessary to determine the instantaneous power split between sources in order to minimize the energy consumption of the whole system. In this work, this problem is posed as a nonlinear finite horizon optimal...

A constrained optimization problem is formulated and solved in order to determine the smallest confidence region for the parameters of the Pareto distribution in a proposed family of sets. The objective function is the area of the region, whereas the constraints are related to the required...

Operations research techniques have been used in the space industry since its infancy, and various competing methods and codes, with widely varying characteristics, have been used over time. This survey is intended to give an overview of current application cases of different operations research...

We consider the k-Hyperplane Clustering problem where, given a set of m points in Rn, we have to partition the set into k subsets (clusters) and determine a hyperplane for each of them, so as to minimize the sum of the squares of the Euclidean distances between the points and the hyperplane of...

We consider a competitive version of the traditional aggregate production planning model with capacity constraints. In the general case, multiple products are produced by a few competing producers (oligopoly) with limited capacities. Production quantities, prices and consequently profits depend...

In this paper, we propose a strongly sub-feasible direction method for the solution of inequality constrained optimization problems whose objective functions are not necessarily differentiable. The algorithm combines the subgradient aggregation technique with the ideas of generalized cutting...

We present a new piecewise linear approximation of non-linear optimization problems. It can be seen as a variant of classical triangulations that leaves more degrees of freedom to define any point as a convex combination of the samples. For example, in the traditional Union Jack approach a...

The purpose of this paper is to present a new approach to model capacity constraints in discrete choice with at least some capacity-related variables missing, like e.g. the price of a commodity. Airport choice models often do not contain air fares because of measurement difficulties as air fares...