All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 171

Showing per page

Condiciones suficientes para la existencia de solución óptima en un programa semi-infinito.

Miguel Angel Goberna Torrent, Jesús T. Pastor Ciurana (1983)

Trabajos de Estadística e Investigación Operativa

Bajo condiciones muy generales, la acotación del conjunto factible en un problema de Programación Semi-Infinita garantiza la existencia de solución óptima del problema. Por ello, se estudian en la primera parte condiciones suficientes para la acotación del conjunto de soluciones de un sistema de infinitas ecuaciones. En la segunda parte se dan condiciones de diversa índole que involucran a la función objetivo de distintas maneras, a saber, a través de la función de Lagrange asociada al problema,...

Configuration des lignes d'usinage à boîtiers multibroches : une approche mixte

Olga Guschinskaya, Alexandre Dolgui (2009)

RAIRO - Operations Research

Ce travail porte sur l'optimisation des lignes d'usinage pour la grande série. Une telle ligne comporte plusieurs postes de travail, chacun étant équipé avec boîtiers multibroches. Un boîtier multibroche exécute plusieurs opérations en parallèle. Lors de la conception en avant-projet, il est nécessaire d'affecter toutes les opérations à des boîtiers et des postes de travail de sorte à minimiser le nombre de postes et de boîtiers utilisés. Pour ce nouveau problème d'équilibrage des lignes de production,...

Configuring a sensor network for fault detection in distributed parameter systems

Maciej Patan, Dariusz Uciński (2008)

International Journal of Applied Mathematics and Computer Science

The problem of fault detection in distributed parameter systems (DPSs) is formulated as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A computational scheme is provided for the design of a network of observation locations in a spatial domain that are supposed to be used while detecting changes in the underlying parameters of a distributed parameter system. The setting considered relates to a situation where from among...

Conical differentiability for bone remodeling contact rod models

Isabel N. Figueiredo, Carlos F. Leal, Cecília S. Pinto (2005)

ESAIM: Control, Optimisation and Calculus of Variations

We prove the conical differentiability of the solution to a bone remodeling contact rod model, for given data (applied loads and rigid obstacle), with respect to small perturbations of the cross section of the rod. The proof is based on the special structure of the model, composed of a variational inequality coupled with an ordinary differential equation with respect to time. This structure enables the verification of the two following fundamental results: the polyhedricity of a modified displacement...

Conical differentiability for bone remodeling contact rod models

Isabel N. Figueiredo, Carlos F. Leal, Cecília S. Pinto (2010)

ESAIM: Control, Optimisation and Calculus of Variations

We prove the conical differentiability of the solution to a bone remodeling contact rod model, for given data (applied loads and rigid obstacle), with respect to small perturbations of the cross section of the rod. The proof is based on the special structure of the model, composed of a variational inequality coupled with an ordinary differential equation with respect to time. This structure enables the verification of the two following fundamental results: the polyhedricity of a modified displacement constraint...

Conjugate gradient algorithms for conic functions

Ladislav Lukšan (1986)

Aplikace matematiky

The paper contains a description and an analysis of two modifications of the conjugate gradient method for unconstrained minimization which find a minimum of the conic function after a finite number of steps. Moreover, further extension of the conjugate gradient method is given which is based on a more general class of the model functions.

Consistency checking within local search applied to the frequency assignment with polarization problem

Michel Vasquez, Audrey Dupont, Djamal Habet (2003)

RAIRO - Operations Research - Recherche Opérationnelle

We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.

Consistency checking within local search applied to the frequency assignment with polarization problem

Michel Vasquez, Audrey Dupont, Djamal Habet (2010)

RAIRO - Operations Research

We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.

Consistency-driven approximation of a pairwise comparison matrix

Esther Dopazo, Jacinto González-Pachón (2003)

Kybernetika

The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within a distance-based...

Constrained optimality problem of Markov decision processes with Borel spaces and varying discount factors

Xiao Wu, Yanqiu Tang (2021)

Kybernetika

This paper focuses on the constrained optimality of discrete-time Markov decision processes (DTMDPs) with state-dependent discount factors, Borel state and compact Borel action spaces, and possibly unbounded costs. By means of the properties of so-called occupation measures of policies and the technique of transforming the original constrained optimality problem of DTMDPs into a convex program one, we prove the existence of an optimal randomized stationary policies under reasonable conditions.

Constrained optimization: A general tolerance approach

Tomáš Roubíček (1990)

Aplikace matematiky

To overcome the somewhat artificial difficulties in classical optimization theory concerning the existence and stability of minimizers, a new setting of constrained optimization problems (called problems with tolerance) is proposed using given proximity structures to define the neighbourhoods of sets. The infimum and the so-called minimizing filter are then defined by means of level sets created by these neighbourhoods, which also reflects the engineering approach to constrained optimization problems....

Currently displaying 101 – 120 of 171