Sensitivity analysis for stationary and ergodic queues: additional results

1994 ◽  
Vol 26 (2) ◽  
pp. 556-560 ◽  
Author(s):  
P. Konstantopoulos ◽  
M. Zazanis
Keyword(s):  
Sensitivity Analysis ◽  
Stationary Distribution ◽  
Perturbation Analysis ◽  
Additional Condition ◽  
Approximation Scheme ◽  
Discontinuous Functions ◽  
Stationary Workload ◽  
The Right

Perturbation analysis estimators for expectations of possibly discontinuous functions of the time-stationary workload were derived in [2]. The expressions obtained may, however, not be valid if the customer-stationary distribution of the workload has atoms (at points other than zero). This was pointed out by Brémaud and Lasgouttes in [1]. In this note we clearly state the additional condition required for the validity of the expressions in [2]. We furthermore show how our approximation scheme can also be used to obtain the correct expressions for the right and left derivatives given in [1].

Sensitivity analysis for stationary and ergodic queues: additional results

1994 ◽  
Vol 26 (02) ◽  
pp. 556-560 ◽  
Author(s):  
P. Konstantopoulos ◽  
M. Zazanis
Keyword(s):  
Sensitivity Analysis ◽  
Stationary Distribution ◽  
Perturbation Analysis ◽  
Additional Condition ◽  
Approximation Scheme ◽  
Discontinuous Functions ◽  
Stationary Workload ◽  
The Right

Perturbation analysis estimators for expectations of possibly discontinuous functions of the time-stationary workload were derived in [2]. The expressions obtained may, however, not be valid if the customer-stationary distribution of the workload has atoms (at points other than zero). This was pointed out by Brémaud and Lasgouttes in [1]. In this note we clearly state the additional condition required for the validity of the expressions in [2]. We furthermore show how our approximation scheme can also be used to obtain the correct expressions for the right and left derivatives given in [1].

Local Perturbation Analysis of Linear Programming with Functional Relation Among Parameters

2013 ◽  
pp. 1-24
Author(s):  
Payam Hanafizadeh ◽  
Abolfazl Ghaemi ◽  
Madjid Tavana
Keyword(s):  
Sensitivity Analysis ◽  
Linear Programming ◽  
Objective Function ◽  
Perturbation Analysis ◽  
Functional Relation ◽  
Local Perturbation ◽  
Nonlinear Functional ◽  
Functional Relations ◽  
Software Packages ◽  
The Right

In this paper, the authors study the sensitivity analysis for a class of linear programming (LP) problems with a functional relation among the objective function parameters or those of the right-hand side (RHS). The classical methods and standard sensitivity analysis software packages fail to function when a functional relation among the LP parameters prevail. In order to overcome this deficiency, the authors derive a series of sensitivity analysis formulae and devise corresponding algorithms for different groups of homogenous LP parameters. The validity of the derived formulae and devised algorithms is corroborated by open literature examples having linear as well as nonlinear functional relations between their vector b or vector c components.

Local Perturbation Analysis of Linear Programming with Functional Relation Among Parameters

2011 ◽  
Vol 2 (1) ◽  
pp. 42-65 ◽  
Author(s):  
Payam Hanafizadeh ◽  
Abolfazl Ghaemi ◽  
Madjid Tavana
Keyword(s):  
Sensitivity Analysis ◽  
Linear Programming ◽  
Perturbation Analysis ◽  
Functional Relation ◽  
Local Perturbation ◽  
Analysis Software ◽  
Nonlinear Functional ◽  
Functional Relations ◽  
Software Packages ◽  
The Right

In this paper, the authors study the sensitivity analysis for a class of linear programming (LP) problems with a functional relation among the objective function parameters or those of the right-hand side (RHS). The classical methods and standard sensitivity analysis software packages fail to function when a functional relation among the LP parameters prevail. In order to overcome this deficiency, the authors derive a series of sensitivity analysis formulae and devise corresponding algorithms for different groups of homogenous LP parameters. The validity of the derived formulae and devised algorithms is corroborated by open literature examples having linear as well as nonlinear functional relations between their vector b or vector c components.

An extension of a theorem concerning an interesting Markov chain

1973 ◽  
Vol 10 (4) ◽  
pp. 886-890 ◽  
Author(s):  
W. J. Hendricks
Keyword(s):  
Markov Chain ◽  
Stationary Distribution ◽  
Ergodic Markov Chain ◽  
The Right

In a single-shelf library of N books we suppose that books are selected one at a time and returned to the kth position on the shelf before another selection is made. Books are moved to the right or left as necessary to vacate position k. The probability of selecting each book is assumed to be known, and the N! arrangements of the books are considered as states of an ergodic Markov chain for which we find the stationary distribution.

Sensitivity analysis for stationary and ergodic queues

1992 ◽  
Vol 24 (03) ◽  
pp. 738-750 ◽  
Author(s):  
P. Konstantopoulos ◽  
Michael A. Zazanis
Keyword(s):  
Sensitivity Analysis ◽  
Steady State ◽  
Performance Measures ◽  
Perturbation Analysis ◽  
Service Process ◽  
Single Server ◽  
Stationary Version ◽  
Major Interest ◽  
Regenerative Approach ◽  
Steady State Performance

Starting with some mild assumptions on the parametrization of the service process, perturbation analysis (PA) estimates are obtained for stationary and ergodic single-server queues. Besides relaxing the stochastic assumptions, our approach solves some problems associated with the traditional regenerative approach taken in most of the previous work in this area. First, it avoids problems caused by perturbations interfering with the regenerative structure of the system. Second, given that the major interest is in steady-state performance measures, it examines directly the stationary version of the system, instead of considering performance measures expressed as Cesaro limits. Finally, it provides new estimators for general (possibly discontinuous) functions of the workload and other steady-state quantities.

scholarly journals The Class of Distributions Associated with the Generalized Pollaczek-Khinchine Formula

2012 ◽  
Vol 49 (3) ◽  
pp. 883-887 ◽  
Author(s):  
Offer Kella
Keyword(s):  
Brownian Motion ◽  
Stationary Distribution ◽  
Lévy Process ◽  
Random Variables ◽  
Levy Process ◽  
Independent Random Variables ◽  
Reflected Brownian Motion ◽  
Distribution Of The Maximum ◽  
Workload Distribution ◽  
Stationary Workload

The goal is to identify the class of distributions to which the distribution of the maximum of a Lévy process with no negative jumps and negative mean (equivalently, the stationary distribution of the reflected process) belongs. An explicit new distributional identity is obtained for the case where the Lévy process is an independent sum of a Brownian motion and a general subordinator (nondecreasing Lévy process) in terms of a geometrically distributed sum of independent random variables. This generalizes both the distributional form of the standard Pollaczek-Khinchine formula for the stationary workload distribution in the M/G/1 queue and the exponential stationary distribution of a reflected Brownian motion.

A two Timescale Stochastic Approximation Scheme for Simulation-Based Parametric Optimization

1998 ◽  
Vol 12 (4) ◽  
pp. 519-531 ◽  
Author(s):  
Shalabh Bhatnagar ◽  
Vivek S. Borkar
Keyword(s):  
Stochastic Approximation ◽  
Perturbation Analysis ◽  
Parametric Optimization ◽  
Approximation Scheme ◽  
Infinitesimal Perturbation Analysis ◽  
Simulation Based ◽  
Infinitesimal Perturbation ◽  
Two Timescale Stochastic Approximation

A two timescale stochastic approximation scheme which uses coupled iterations is used for simulation-based parametric optimization as an alternative to traditional “infinitesimal perturbation analysis” schemes. It avoids the aggregation of data present in many other schemes. Its convergence is analyzed, and a queueing example is presented.

Sign in / Sign up

Export Citation Format

Share Document