- RIUMA Principal
- Listar por autor
Listar por autor "Hendrix, Eligius María Theodorus"
Mostrando ítems 1-20 de 29
-
A CUDA approach to compute perishable inventory control policies using value iteration.
Ortega, Gloria L.; Hendrix, Eligius María Theodorus; García-Fernández, Inmaculada (Springer Nature, 2018)Dynamic programming (DP) approaches, in particular value iteration, is often seen as a method to derive optimal policies in inventory management. The challenge in this approach is to deal with an increasing state space ... -
Algoritmos paralelos de memoria compartida que determinan el menor tama˜no de un ´arbol binario al refinar un simplex regular
Aparicio, Guillermo; Salmerón, José Manuel; González-Casado, Leocadio; Asenjo-Plaza, Rafael; García-Fernández, Inmaculada; Hendrix, Eligius María Theodorus[et al.] (2015-10-05)En el ambito de la optimizacion global basada en tecnicas de ramificacion y acotacion, cuando el espacio de busqueda es un n-sımplex regular es habitual utilizar como regla de division la biseccion por el lado mayor, ... -
Aspectos computacionales en la bisección de un n-simplex regular.
Aparicio, Guillermo; Casado, Leocadio G.; García-Fernández, Inmaculada; Hendrix, Eligius María Theodorus; Toth, B.G. (2013-11-05)En el ambito de la optimizacion global basada en tecnicas de ramificacion y acotacion, cuando el espacio de busqueda es un n-simplex regular es habitual utilizar como regla de division la biseccion por el lado mayor. ... -
Branch and Bound algorithms in greenhouse climate control
Hermelink, Marleen (2016-06-28)The horticultural sector has become an increasingly important sector of food production, for which greenhouse climate control plays a vital role in improving its sustainability. One of the methods to control the greenhouse ... -
Computational methods and parallel strategies in dynamic decision making
Gutiérrez-Alcoba, Alejandro (UMA Editorial, 2018)Esta tesis analiza aplicaciones de toma de decisiones dinámica para un conjunto de problemas. Pueden diferenciarse dos líneas principales. La primera trata problemas de gestión de la cadena de suministro para productos ... -
Decomposition methods for mixed-integer nonlinear programming
Muts, Pavlo (UMA Editorial, 2021-11-05)La programación no lineal de enteros mixtos es un campo de optimización importante y desafiante. Este tipo de problemas pueden contener variables continuas e enteras, así como restricciones lineales y no lineales. Esta ... -
Design optimization of a 3-stage membrane cascade for oligosaccharides purification using mixed integer non-linear programming.
Rizki, Zulhaj; Janssen, Anja E.M.; Hendrix, Eligius María Theodorus; van der Padt, Albert; Boom, Remko M.; Claassen, G.D.H.[et al.] (2020)Inhomogeneous membrane cascade systems have been utilized to purify fructooligosaccharides (FOS). Such a process allows a different setup at every stage of the cascade. Varying the setup at every stage implies an optimization ... -
Experiments with Active-Set LP Algorithms Allowing Basis Deficiency
Hendrix, Eligius María Theodorus; Guerrero-García, Pablo (IOAP-MDPI, 2022-12-23)n interesting question for linear programming (LP) algorithms is how to deal with solutions in which the number of nonzero variables is less than the number of rows of the matrix in standard form. An approach is that of ... -
Generating order policies by SDP: non-stationary demand and service level constraints
Pauls-Worm, Karin G.J.; Hendrix, Eligius María Theodorus (2015-07-06)Inventory control implies dynamic decision making. Therefore, dynamic programming seems an appropriate approach to look for order policies. For finite horizon planning, the implementation of service level constraints ... -
Heuristics for Longest Edge Selection in Simplicial Branch and Bound
Herrera, Juan F.R.; Casado, Leocadio G.; Hendrix, Eligius María Theodorus; García-Fernández, Inmaculada (2015-07-06)Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. ... -
Implementaciones paralelas para un problema de control de inventarios de productos perecederos
Gutiérrez-Alcoba, Alejandro; Hendrix, Eligius María Theodorus; García-Fernández, Inmaculada; Ortega, Gloria L. (2015-10-05)En este trabajo se analizan y eval uan dos implementaciones de un algoritmo de optimizaci on para un problema de control de inventarios de productos perecederos. Las implementaciones se han llevado a cabo utilizando ... -
Inventory control for a non-stationary demand perishable product: comparing policies and solution methods
Hendrix, Eligius María Theodorus; Pauls-Worm, Karin G.J. (2018-03-02)This paper summarizes our findings with respect to order policies for an inventory control problem for a perishable product with a maximum fixed shelf life in a periodic review system, where chance constraints play a role. ... -
Modelling vessel fleet composition for maintenance operations at offshore wind farms
Gutiérrez-Alcoba, Alejandro; García-Fernández, Inmaculada; Ortega López, Gloria; Hendrix, Eligius María Theodorus (2018-12-20)Chartering a vessel fleet to support maintenance operations at offshore wind farms (OWF's) constitutes one of the major costs of maintaining this type of installations. Literature describes deterministic optimization models ... -
On an OptLearn implementation using collaborative filtering.
Fuster López, Alejandro; Guerrero-García, Pablo; Hendrix, Eligius María Theodorus; Martínez-Cruz, Jesús; Nowak, Ivo (2023)The aim of the iMath project is to develop a recommender system where a student is recommended a next question or literature in a learning platform MathE. This paper describes the systems developed based on collaborative ... -
On Augmented Lagrangeans in Linear Programming (LP) Phase I
The concept of linking constraints to an objective in optimization problems was found due to Lagrange in the 19th century. The so-called Lagrange multipliers were related to duality theory in the 20th century. At the same ... -
On computational procedures for Value Iteration in inventory control
Dynamic programming (DP) is often seen in inventory control to lead to optimal ordering policies. When considering stationary demand, Value Iteration (VI) may be used to derive the best policy. In this paper, our focus is ... -
On conceptualisation and an overview of learning path recommender systems in e-learning.
Fuster López, Alejandro; Martínez-Cruz, Jesús; Guerrero-García, Pablo; Hendrix, Eligius María Theodorus; Košir, Andrej; Nowak, Ivo; Oneto, Luca; Sirmakessis, Spiros; Pacheco, Maria Fátima; Fernandes, Florbela Pires; Pereira, Ana Isabel[et al.] (2024-06-10)The use of e-learning systems has a long tradition, where students can study online helped by a system. In this context, the use of recommender systems is relatively new. In our research project, we investigated various ... -
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound.
G.-Tóth, Boglárka; Hendrix, Eligius María Theodorus; Casado, Leocadio G.; Messine, Fréderic (Springer Nature, 2024-07-22)We consider a simplicial branch and bound Global Optimization algorithm, where the search region is a simplex. Apart from using longest edge bisection, a simplicial partition set can be reduced due to monotonicity of the ... -
On decomposition and multiobjective-based column and disjunctive cut generation for MINLP.
Muts, Pavlo; Nowak, Ivo; Hendrix, Eligius María Theodorus (Springer Nature, 2020)Most industrial optimization problems are sparse and can be formulated as block- separable mixed-integer nonlinear programming (MINLP) problems, defined by linking low-dimensional sub-problems by (linear) coupling constraints. ... -
On multimodality of obnoxious faclity location models
Frank, Ditte (2016-07-21)Obnoxious single facility location models are models that have the aim to find the best location for an undesired facility. Undesired is usually expressed in relation to the so-called demand points that represent locations ...