Recursive estimation of inventory quality classes using sampling.
Recursive form of general limited memory variable metric methods
In this report we propose a new recursive matrix formulation of limited memory variable metric methods. This approach can be used for an arbitrary update from the Broyden class (and some other updates) and also for the approximation of both the Hessian matrix and its inverse. The new recursive formulation requires approximately multiplications and additions per iteration, so it is comparable with other efficient limited memory variable metric methods. Numerical experiments concerning Algorithm...
RedInv-SA : a simulated annealing for the quadratic assignment problem
Redinv-SA: la simulated annealing for the quadratic assignment problem
An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing-type heuristic (which we called RedInv-SA). Some results from tests with known literature instances are presented.
Reducing Off-Line to On-Line: an Example and Its Applications
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
Réductions de graphes et systèmes de Church-Rosser
Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal
Redundance of vertices of the cube relatively to its minimal ellipsoid.
Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation
Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we reconsider...
Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation
Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we...
Reformulations in Mathematical Programming: Definitions and Systematics
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts to move...
Regions of stability for ill-posed convex programs
Regions of stability are chunks of the space of parameters in which the optimal solution and the optimal value depend continuously on the data. In these regions the problem of solving an arbitrary convex program is a continuous process and Tihonov's regularization is possible. This paper introduces a new region we furnisch formulas for the marginal value. The importance of the regions of stability is demostrated on multicriteria decision making problems and in calculating the minimal index set...
Regions of stability for ill-posed convex programs: An addendum
The marginal value formula in convex optimization holds in a more restrictive region of stability than that recently claimed in the literature. This is due to the fact that there are regions of stability where the Lagrangian multiplier function is discontinuous even for linear models.
Regression Models in Planning of Experiments
Régularité des matrices à diagonale dominante. Applications à l'absorption dans les chaînes et processus de Markov
Regularity properties of optimal transportation problems arising in hedonic pricing models
We study a form of optimal transportation surplus functions which arise in hedonic pricing models. We derive a formula for the Ma–Trudinger–Wang curvature of these functions, yielding necessary and sufficient conditions for them to satisfy (A3w). We use this to give explicit new examples of surplus functions satisfying (A3w), of the form b(x,y) = H(x + y) where H is a convex function on ℝn. We also show that the distribution of equilibrium contracts in this hedonic pricing model is absolutely continuous...
Regularization in state space
Regularization method for stochastic mathematical programs with complementarity constraints
In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints (SMPECs) that has been discussed by Lin and Fukushima (2003). Based on a reformulation given therein, we propose a regularization method for solving the problems. We show that, under a weak condition, an accumulation point of the generated sequence is a feasible point of the original problem. We also show that such an accumulation point is S-stationary to the problem under additional assumptions.
Regularization method for stochastic mathematical programs with complementarity constraints
In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints (SMPECs) that has been discussed by Lin and Fukushima (2003). Based on a reformulation given therein, we propose a regularization method for solving the problems. We show that, under a weak condition, an accumulation point of the generated sequence is a feasible point of the original problem. We also show that such an accumulation point is S-stationary to the problem under additional assumptions....