Approximation of set-valued functions by single-valued one
Approximation of the pareto optimal set for multiobjective optimal control problems using viability kernels
This paper provides a convergent numerical approximation of the Pareto optimal set for finite-horizon multiobjective optimal control problems in which the objective space is not necessarily convex. Our approach is based on Viability Theory. We first introduce a set-valued return function V and show that the epigraph of V equals the viability kernel of a certain related augmented dynamical system. We then introduce an approximate set-valued return function with finite set-values as the solution of...
Approximation par un processus de diffusion de files GI/GI/1 avec dépendance de l'état
Approximation Results Toward Nearest Neighbor Heuristic
Approximations for Markov decision problems
Approximations to Stochastic Programs with Complete Fixed Recourse.
Approximative solutions of stochastic optimization problems
The aim of this paper is to present some ideas how to relax the notion of the optimal solution of the stochastic optimization problem. In the deterministic case, -minimal solutions and level-minimal solutions are considered as desired relaxations. We call them approximative solutions and we introduce some possibilities how to combine them with randomness. Relations among random versions of approximative solutions and their consistency are presented in this paper. No measurability is assumed, therefore,...
Arbres binaires de recherche : propriétés combinatoires et applications
Articles ROADEF 2007
Artificial intelligence methods in diagnostics of analog systems
Asignación de recursos Max-Min: propiedades y algoritmos.
Este trabajo trata el problema de asignación de recursos cuando el objetivo es maximizar la mínima recompensa y las funciones recompensa son continuas y estrictamente crecientes. Se estudian diferentes propiedades que conducen a algoritmos que permiten de forma eficiente la resolución de gran variedad de problemas de esta naturaleza, tanto con variables continuas como discretas.
Aspects of control for the normal Markov processes.
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures are presented....
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions...
Assembly Line Balancing With Smoothed Work Station Assignments
Assessment of landslide susceptibility by decision trees in the metropolitan area of Istanbul, Turkey.
Assignment problem with fuzzy estimates of effectiveness
Asymptotic analysis, existence and sensitivity results for a class of multivalued complementarity problems
In this work we study the multivalued complementarity problem on the non-negative orthant. This is carried out by describing the asymptotic behavior of the sequence of approximate solutions to its multivalued variational inequality formulation. By introducing new classes of multifunctions we provide several existence (possibly allowing unbounded solution set), stability as well as sensitivity results which extend and generalize most of the existing ones in the literature. We also present some kind...
Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic.
Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
In this paper, we study the differentiability of the trajectories of the logarithmic barrier algorithm for a nonlinear program when the set Λ* of the Karush-Kuhn-Tucker multiplier vectors is empty owing to the fact that the constraint qualifications are not satisfied.