Résolution paramétrée de familles de systèmes linéaires
Resource allocation in a mobile telephone network : a constructive repair algorithm
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...
Resource allocation in a mobile telephone network: A constructive repair algorithm
To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved...
Resource relocation on asymmetric networks.
Restricted admissibility of batches into an //1 type bulk queue with modified Bernoulli schedule server vacations
We investigate the steady state behavior of an //1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various states of...
Restricted Admissibility of Batches into an M/G/1 Type Bulk Queue with Modified Bernoulli Schedule Server Vacations
We investigate the steady state behavior of an M/G/1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various states...
Results of short-period helicopter system identification using output-error and hybrid search-gradient optimization algorithm.
ReSySTER: A hybrid recommender system for Scrum team roles based on fuzzy and rough sets
Agile development is a crucial issue within software engineering because one of the goals of any project leader is to increase the speed and flexibility in the development of new commercial products. In this sense, project managers must find the best resource configuration for each of the work packages necessary for the management of software development processes in order to keep the team motivated and committed to the project and to improve productivity and quality. This paper presents ReSySTER,...
Retailer's EOQ model with limited storage space under partially permissible delay in payments.
Retailer’S Lot-Sizing Policy Under Two Warehouses and Two Levels of Delay Permitted Using Algebraic Method
Retailer's optimal pricing and ordering policies for non-instantaneous deteriorating items with price-dependent demand and partial backlogging.
Retailer’S Replenishment Policies Under Conditions of Permissible Delay in Payments
Reverse bridge theorem under constraint partition.
Reverse convex problems: an approach based on optimality conditions.
Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
Based on conjugate duality we construct several gap functions for general variational inequalities and equilibrium problems, in the formulation of which a so-called perturbation function is used. These functions are written with the help of the Fenchel-Moreau conjugate of the functions involved. In case we are working in the convex setting and a regularity condition is fulfilled, these functions become gap functions. The techniques used are the ones considered in [Altangerel L., Boţ R.I., Wanka...
Riemannian convexity.
Riemannian convexity in programming. II.
Risk minimization in the model with transaction costs
The problem of hedging a contingent claim with minimization of quadratic risk is studied. Existence of an optimal strategy for the model with proportional transaction cost and nondelayed observation is shown.
Risk objectives in two-stage stochastic programming models
In applications of stochastic programming, optimization of the expected outcome need not be an acceptable goal. This has been the reason for recent proposals aiming at construction and optimization of more complicated nonlinear risk objectives. We will survey various approaches to risk quantification and optimization mainly in the framework of static and two-stage stochastic programs and comment on their properties. It turns out that polyhedral risk functionals introduced in Eichorn and Römisch...
Risk probability optimization problem for finite horizon continuous time Markov decision processes with loss rate
This paper presents a study the risk probability optimality for finite horizon continuous-time Markov decision process with loss rate and unbounded transition rates. Under drift condition, which is slightly weaker than the regular condition, as detailed in existing literature on the risk probability optimality Semi-Markov decision processes, we prove that the value function is the unique solution of the corresponding optimality equation, and demonstrate the existence of a risk probability optimization...