Displaying 81 – 100 of 221

Showing per page

Método primal dual para modelos de planificación con costes cóncavos y limitaciones de capacidad.

Luis Onieva, S. Lozano, Juan Carlos Larrañeta Astola, Rafael Ruiz Usano (1987)

Qüestiió

Este trabajo estudia el problema de planificación de la producción representado por un modelo de costes cóncavos sujeto a limitaciones de capacidad. La relajación lineal del modelo es analizada usando un enfoque primal-dual. Las soluciones del dual se obtienen resolviendo para cada producto modelos sin restricciones de capacidad asignando un precio a las mismas. El primal reducido supone un test de admisibilidad de dichas soluciones. El dual reducido permite calcular los nuevos precios recomendados...

Métodos duales y algoritmos híbridos para problemas de "set partitioning".

Jaime Barceló Bugeda, Elena Fernández Areizaga (1990)

Trabajos de Investigación Operativa

En este artículo estudiamos la utilización de métodos duales en el diseño de algoritmos híbridos para la resolución de problemas de "Set Partitioning" (SP). Las técnicas duales resultan de gran interés para resolver problemas con estructura combinatoria no sólo porque generan cotas inferiores sino porque, además, su utilización junto con heurísticas y procedimientos de generación de desigualdades en el diseño de algoritmos híbridos permite evaluar la calidad de las cotas superiores obtenidas. Los...

Metric subregularity for nonclosed convex multifunctions in normed spaces

Xi Yin Zheng, Kung Fu Ng (2010)

ESAIM: Control, Optimisation and Calculus of Variations

In terms of the normal cone and the coderivative, we provide some necessary and/or sufficient conditions of metric subregularity for (not necessarily closed) convex multifunctions in normed spaces. As applications, we present some error bound results for (not necessarily lower semicontinuous) convex functions on normed spaces. These results improve and extend some existing error bound results.

Minimization of a convex quadratic function subject to separable conical constraints in granular dynamics

Pospíšil, Lukáš, Dostál, Zdeněk (2015)

Programs and Algorithms of Numerical Mathematics

The numerical solution of granular dynamics problems with Coulomb friction leads to the problem of minimizing a convex quadratic function with semidefinite Hessian subject to a separable conical constraints. In this paper, we are interested in the numerical solution of this problem. We suggest a modification of an active-set optimal quadratic programming algorithm. The number of projection steps is decreased by using a projected Barzilai-Borwein method. In the numerical experiment, we compare our...

Minimization of communication expenditure for seasonal products

Igor Bykadorov, Andrea Ellero, Elena Moretti (2002)

RAIRO - Operations Research - Recherche Opérationnelle

We consider a firm that sells seasonal goods. The firm seeks to reach a fixed level of goodwill at the end of the selling period, with the minimum total expenditure in promotional activities. We consider the linear optimal control problem faced by the firm which can only control the communication expenditure rate; communication is performed by means of advertising and sales promotion. Goodwill and sales levels are considered as state variables and word-of-mouth effect and saturation aversion are...

Minimization of communication expenditure for seasonal products

Igor Bykadorov, Andrea Ellero, Elena Moretti (2010)

RAIRO - Operations Research

We consider a firm that sells seasonal goods. The firm seeks to reach a fixed level of goodwill at the end of the selling period, with the minimum total expenditure in promotional activities. We consider the linear optimal control problem faced by the firm which can only control the communication expenditure rate; communication is performed by means of advertising and sales promotion. Goodwill and sales levels are considered as state variables and word-of-mouth effect and saturation aversion are...

Currently displaying 81 – 100 of 221