文档介绍：江西财经大学
2005~2006 学年第一学期期末考试试卷
试卷代码:03275A 卷课时:80
课程名称:运筹学Ⅱ(英) 适用对象:管理科学专业
1. Fill in the blanks (10 points)
(a) In dynamic programming problem, when stage evaluation index is probability, then the
⎧ f (S ) = {v (s , x ) ⋅ f (S )}
⎪ k k opt k k k k +1 k +1
recursive relationship is ⎨ xk ∈Dk
⎩⎪ f n+1 (Sn+1 ) = 1
(b) The key point of probabilistic dynamic programming differs from deterministic dynamic programming
is the state at the next stage is pletely determined by the state and policy decision at the current
stage.
(c) For non-linear programming, the local optimal solution is not generally a global optimal solution, but it
is true for convex programming.
(d) The model M/M/1 means that in a queueing system, all interarrival times are distributed according to
an exponential distribution, and all service times are distributed according to another exponential
distribution, and the number of servers is 1.
(e) The birth-and-death equation for the following graph is λn−1Pn−1 + μn+1Pn+1 = (λn + μn )Pn
λn-2
λn-1 λn
n-2 n-1 n n+1
μn μn+1
μn-1
2. Three OR teams adopt different methods to study a scientific research project. The
probability of failure is ,, respectively. To decrease the probability of all three
teams defeated, two scientists are allocated to these research teams, and after that, the failure