yunchou(国外英语资料).doc

yunchou Disclaimer, what you are looking for is: operational research questions (you can click keywords to locate one by one). This is a snapshot of the original web page, /ec2007/C11/res/30/res/2007, on 2010, 05, 11, 14:51:05. Operational research questions Fill in the blanks (1 cents per room, 16 points) 1. transportation problem with supply points, M N demand point is a special case of _ linear programming problem. When the transportation problem When the problem of supply and demand is balanced, the number of base variables in any base solution is m+n-1__ 2. in the graph theory, the tree has the characteristics of connectivity without cycles, the number of lines in the tree must be equal to the number of -1___. _ 3. the decision criterion of optimistic coefficient, optimistic coefficient a=1 is _ optimistic ____ decision standard, a=0 is _ pessimistic ____ Decision criteria 4. in the use of graphical method for linear programming problem, the objective function S=ClX1+C2X2, then the line ClX1+C2X2=10 is one of S Parallel lines _, while the non empty feasible domain bounded time optimal solution will _ vertex in the feasible region of the _ reach. 5. linear programming mathematical model three elements: decision variables, objective functions, constraints 6. in multiobjective decision making, y+=y-=0 must be satisfied at the same time when x=b is specified in the target Thats what its all about 7. dynamic programming is a method to solve the optimization problem of multi-stage decision process 8., the three elements of the game model: the Bureau, the people, the strategy, the win Two, single choice (in each item of four answer options, choose a correct answer, and the No. The code to fill in the brackets. Every day 1.5 points, a total of 15 points) If an enterprise needs 1. years bearing 2400 sets, the best order quantity is 300 sets, each priced at 400 yuan into the warehouse, The average inventory amount is () A.120000 yuan, B.60000 yuan, c.2400/300X 400, D.1/2