2006年下半年operationalresearch试卷A.docVIP

江西财经大学200５下半年《运筹学Ⅱ》(英)试卷A 适用班级：管理科学专业 1. Fill in the blanks (10 points) In dynamic programming problem, when stage evaluation index is probability, then the recursive relationship is The key point of probabilistic dynamic programming differs from deterministic dynamic programming is . For non-linear programming, the local optimal solution is not generally a global optimal solution, but it is true for . The model M/M/1 means that in a queueing system, all interarrival times are distributed according to , and all service times are distributed according to , and the number of servers is . The birth-and-death equation for the following graph is 2. The management of a company is considering three possible new products for next year’s product line. A decision now needs to be made regarding which products to market and at what production levels. Relative information listed in the following table. Product 1 2 3 Start up cost 3 2 0 Marginal net revenue 2 3 1 Capacity used per unit,% 20 40 20 Only 3 units of product 1 could be sold, whereas all units that could be produced of the other two products could be sold. The objective is to determine the number of units of each product to produce in order to maximize the total profit(total net revenue minus start-up costs). Question: Assuming that production quantities must be integers, use dynamic programming to solve this problem 。（25 points）。 3. A toy manufacturer has developed two new toys for possible inclusion in its product line for the upcoming Christmas season. Setting up the production facilities to begin production would cost $60,000 for toy 1 and $90,000 for toy 2. Once these costs are covered, the toys would generate a unit profit