Constructive Computation in Stochastic Models With Applications 2010
DOI: 10.1007/978-3-642-11492-2_1
View full text | Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 104 publications
0
3
0
Order By: Relevance
“…If and for any given policy , then the optimal dynamic rationing policy is given by In this case, we obtain and It follows from Subsection 1.1.4 of Chapter 1 in Li ( 2010 ) that At the same time, it follows from ( 8 ) to ( 11 ) that Thus we obtain where …”
Section: Monotonicity and Optimalitymentioning
confidence: 95%
See 2 more Smart Citations
“…If and for any given policy , then the optimal dynamic rationing policy is given by In this case, we obtain and It follows from Subsection 1.1.4 of Chapter 1 in Li ( 2010 ) that At the same time, it follows from ( 8 ) to ( 11 ) that Thus we obtain where …”
Section: Monotonicity and Optimalitymentioning
confidence: 95%
“…In this case, we write the stationary probability vector of the policy-based birth-death process as Obviously, the stationary probability vector is the unique solution to the system of linear equations: and , where is a column vector of ones with a suitable dimension. We write and It follows from Subsection 1.1.4 of Chapter 1 in Li ( 2010 ) that By using the policy-based birth-death process , now we define a more general reward function in the stock-rationing queue. It is seen from Table 1 that the reward function with respect to both states and policies is defined as a profit rate (i.e.…”
Section: Optimization Model Formulationmentioning
confidence: 99%
See 1 more Smart Citation