文档介绍：江西财经大学
2004~2005 学年第一学期期末考试试卷
试卷代码:03275A 卷课时:80
课程名称:运筹学Ⅱ(英) 适用对象:管理科学专业
1. Fill in the blanks. (10 points)
(a) If the objective value is maximum sales revenue, then in dynamic programming, the basic
f (S ) = {v (s , x ) + f (S )}
⎪⎧ k k max k k k k+1 k +1
equation is ⎨ xk ∈Dk
⎩⎪ f n+1 (Sn+1 ) = 0
(b) The dynamic programming is divided into two types, they are: deterministic dynamic
programming and probabilistic dynamic programming.
(c) The integer programming is divided into three types, they are :pure integer programming,
mixed integer programming and binary integer programming.
λ
(d) For M/M/1 model, the expected number of customers in queueing system is L =
μ−λ
λ2
The expected queue length is L =
q μ(μ−λ)
1
The waiting time in system for each individual customer is W =
μ−λ
λ
The waiting time in queue for each individual customer isW =
q μ(μ−λ)
2. pany is planning its advertising strategy for next year for its three major products.
Since the three products are quite different, each advertising effort will focus on a single
product. In units of millions of dollars, a total of 6 is available for advertising next year, where
the advertising expenditure for each product must be an integer greater than or equal to 1. The
vice-president for marketing has established the objective: Determine how much to spend on
each p