Mandelbaum, A. (1989). The dynamic complementarity problem, Preprint. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Multiclass Feedback Queueing Network with a Regular.. - Dupuis, Ramanan (1999) (1 citation) (Correct)
....componentwise. For standard SPs, the condition that the associated matrix D be completely S is a necessary and sufficient condition for the existence of solutions to the SP on AC (and in fact on D) and is in particular a sufficient condition for the existence of a discrete projection [3, 16]. The reference [16] gives a nice overview of the relation of these matrices to the dynamic complementarity problem, which is equivalent to the SP for standard SPs. Since the network SP is not a standard SP (it has 6 directions of constraint in IR 4 ) the completely S condition cannot be used ....
.... For standard SPs, the condition that the associated matrix D be completely S is a necessary and sufficient condition for the existence of solutions to the SP on AC (and in fact on D) and is in particular a sufficient condition for the existence of a discrete projection [3, 16] The reference [16] gives a nice overview of the relation of these matrices to the dynamic complementarity problem, which is equivalent to the SP for standard SPs. Since the network SP is not a standard SP (it has 6 directions of constraint in IR 4 ) the completely S condition cannot be used directly to verify ....
[Article contains additional citation context not shown here]
A. Mandelbaum. The dynamic complementarity problem. Unpublished manuscript, 1989.
Reflecting Diffusions and Queueing Networks - Williams (1998) (Correct)
....a Feller continuous strong Markov process. 2. 3 Oscillation inequality Solutions of a deterministic Skorokhod problem have been used to obtain strong constructions of SRBMs in some cases [DuI91, HR81] While this Skorokhod problem will not have unique solutions for general completely S matrices R [BEK91, Ma92], an oscillation inequality for a perturbed form of this problem can be used to establish tightness for suitable approximations to a SRBM. Indeed, this inequality can be used to show existence of a SRBM (using random walk approximations having small inward jumps at the boundary) and the form ....
Mandelbaum, A. (1992). The dynamic complementarity problem. Preprint.
The QNET Method for Two-Moment Analysis of Closed Manufacturing.. - Dai (1993) (2 citations) (Correct)
....this paper. Lemma 3.1 If A is admissible, then A is completely S. Proof. This lemma can be proved by quoting existing known results. First by Theorem 2.3 of Berman and Plemmons [3, p. 134] an admissible matrix must be a P matrix. Next, it follows from the discussion in Section 2 of Mandelbaum [30] that a P matrix is a completely S matrix. Here we provide a direct proof which seems to be new. Assume that A is admissible. We first show that A is an S matrix. Let D and Gamma be the matrices defined in (3.18) It suffices to prove that R j AD is an S matrix. Let S o = fx 2 R J : x i ....
Mandelbaum, A. The dynamic complementarity problem. Mathematics of Operations Research (to appear).
Moderate Deviations for Queues in Critical Loading - Puhalskii (1997) (Correct)
....1. z = x (I Gamma P T )y, 2. y is componentwise nondecreasing with y k (0) 0; 1 k K, 3. z k (t) 0 and R 1 0 z k (t) dy k (t) 0, 1 k K. The map R P is well defined and Lipshitz continuous for the locally uniform metric on D(R K ) Harrison and Reiman [4] Reiman [19] Mandelbaum [10], Chen and Mandelbaum [2] In the onedimensional case K = 1 and P = 0] the reflection map, which we then denote R , has the explicit form R(x) t) x(t) Gamma inffx(s) 0 s tg 0; t 0 : 2.4) The following characterization of skew reflection is in the spirit of Lemma 3.1 in [18] and Lemma ....
....and only if z is absolutely continuous, and there exists an absolutely continuous function y 2 D(R K ) with the properties z(t) x(t) I Gamma P T ) y(t) a.e. and y k (0) 0; y k (t) 0 a.e. z k (t) y k (t) 0 a.e. 1 k K: Thus z(t) a.e. solves a linear complementarity problem [10, 2]. 3. Moderate Deviations for Single Server Queues in Near Heavy Traffic We consider a sequence of FIFO single server queues indexed by n . We assume that the queues are initially empty. Let A n (t) denote the number of arrivals by t , S n (t) the number of customers served for the first t units ....
A. Mandelbaum, The Dynamic Complementarity Problem, unpublished manuscript (1989).
Existence Condition for the Diffusion Approximations of.. - Chen, Ye (2000) (Correct)
No context found.
Mandelbaum, A. (1989). The dynamic complementarity problem, Preprint.
Brownian Approximations of Multiclass Open Queueing Networks - Chen, Shen, Yao (2001) (Correct)
No context found.
Mandelbaum, A. (1989). The dynamic complementarity problem, Preprint. 34
Brownian Approximations of Multiclass Open Queueing Networks - Chen, Shen, Yao (2001) (Correct)
No context found.
Mandelbaum, A. (1989). The dynamic complementarity problem, Preprint.
Existence Condition for the Diffusion Approximations of.. - Chen, Ye (2001) (Correct)
No context found.
Mandelbaum, A. (1989). The dynamic complementarity problem, Preprint.
An Explicit Formula for the Solution of Certain Optimal.. - Dupuis, Ramanan (1999) (1 citation) (Correct)
No context found.
A. Mandelbaum. The Dynamic Complementarity Problem. Unpublished, 1989.
Diffusion Approximations for Some Multiclass Queueing Networks.. - Chen, Zhang (1997) (1 citation) (Correct)
No context found.
Mandelbaum, A. (1989). "The dynamic complementarity problem" (preprint).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC