Buscar
Mostrando ítems 1-10 de 36
Artículo
Dominators for multiple-objective quasiconvex maximization problems
(Springer, 2000-01-06)
In this paper we address the problem of finding a dominator for a multiple-objective maximization problem with quasiconvex functions. The one-dimensional case is discussed in some detail, showing how a Branch-and-Bound ...
Artículo
Generalized goal programming: polynomial methods and applications
(Springer, 2002-12)
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, ...
Artículo
On the norm of a dc function
(Springer, 2009-11-12)
It is well known that, if a vector-valued function can be written as difference of componentwise convex functions, the norm of such function inherits this property. In this note we show that, if the norm in use is monotonic ...
Artículo
A DC biobjective location model
(Springer, 2002)
In this paper we address the biobjective problem of locating a semiobnoxious facility, that must provide service to a given set of demand points and, at the same time, has some negative effect on given regions in the ...
Artículo
Improving Interval Analysis Bounds by Translations
(Springer, 2003-08-26)
We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate polynomial test functions are considered, showing that translation-based ...
Artículo
A fractional model for locating semi-desirable facilities on networks
(ELSEVIER SCIENCE BV, 2002-01-01)
In this paper, we address the problem of locating a series of facilities on a network maximizing the average distance to population centers (assumed to be distributed in the plane) per unit transportation cost (a function ...
Artículo
An optimal bound for d.c. programs with convex constraints
(Springer, 2001-04-01)
A well-known strategy for obtaining a lower bound on the minimum of a d.c. function f−g over a compact convex set S⊂ℝn consists of replacing the convex function f by a linear minorant at x 0∈S. In this note we show that ...
Artículo
Two-group classification via a biobjective margin maximization model
(ELSEVIER SCIENCE BV, 2006-09-16)
In this paper we propose a biobjective model for two-group classification via margin maximization, in which the margins in both classes are simultaneously maximized. The set of Pareto-optimal solutions is described, yielding ...
Artículo
Problemas de clasificación y optimización
(Real Academia Sevillana de Ciencias, 2003)
El desarrollo de técncias que permitan clasificar entes (seres vivos, elementos, problemas, ... ) en distintas categorías ha sido recurrente en diversas ramas del saber. La creación y difusión de grandes bases de datos y ...
Tesis Doctoral
Programación matemática para las máquinas de vector de apoyo: mathematical programming for support vector machines
(2006)
En esta Tesis Doctoral, presentamos algunas propuestas en las que las herramientas de la Programación Matemática se usan para obtener clasificadores que tengan algunas propiedades interesantes. En aplicaciones prácticas, ...