《运筹学》期终试卷(A卷)（Final paper for operational research (A)）.docVIP

下载本文档

20
0
约6.97千字
约 9页
2017-07-20 发布于河南
举报
版权申诉

《运筹学》期终试卷(A卷)（Final paper for operational research (A)）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

《运筹学》期终试卷(A卷)（Final paper for operational research (A)）

《运筹学》期终试卷(A卷)（Final paper for operational research (A)） The Beijing institute of technologys operations research is a real one Beijing institute of technology The final exam paper (A) The name results Note: the answer must be written on the answer sheet, not in other places. In the course of the examination, you shall not open the examination papers. After the examination, the examination papers will be handed back. 1. Multiple choice questions (2 points per question, 12 points total) 1. Linear programming model has characteristics (). A, all functions are linear functions; B, maximum goal; C, with equality or inequality constraints; D, the variable is non-negative. The following statement is correct (). A, the optimal solution of linear programming is the basic feasible solution; B, the basic solution must be the basic solution; C, linear programming must have a feasible solution; D, the optimal value of linear programming is at most one. 3. A linear programming problem (P) is related to its dual problem (D). A, (P) has A feasible solution (D) has the optimal solution; B, (P) and (D) have the optimal solution. C, (P) is feasible (D) without solution, and (P) there is no finite optimal solution; D, (P) (D) are dual to each other. 4. The basic feasible solution of transportation problem has characteristics (). A, m + n - 1 basis variables; B, m + n potential; C. Balance of production and marketing; D, no closed loop. 5. The following propositions on the question of dynamic programming () are false. A, the sequence of dynamic programming phases is different, and the results are different; B, the state has influence on the decision; C. In solving the shortest path problem, the method of labeling and invertion is the same. D, the solution of dynamic programming can be realized in the list form. 6. The time interval between arrival and successive arrival of customer poisson is subject to negative exponential distribution (). A, different versions of the same concept; B i