This is a preview. Log in through your library . Abstract This paper considers ergodic, continuous-time Markov chains {X (t)} tɛ(-∞, ∞) on Z + = {0, 1,…}. For an arbitrarily fixed N∊ Z+, we study the ...
Mathematics of Operations Research, Vol. 38, No. 3 (August 2013), pp. 569-590 (22 pages) Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback